Question 93
Each vertex of a finite graph can be colored either black or white. Initially all vertices are black. We are allowed to pick a vertex $P$ and change the color of $P$ and all of its neighbours. Is it possible to change the colour of every vertex from black to white by a sequence of operations of this type?