One of my friends suggested the following 2-player game.
Given an undirected graph(not necessarily connected), each player takes turns and removes either one vertex or two adjacent vertices. Removing a vertex from the graph consists of deleting the incident edges as well. The player who does not have any move loses.
Though the rules of the game look very simple, this turns out to be an interesting counting and connectivity game. Infact, using symmetry argument, we have also found that there is a winning strategy for the second player when the undirected graph is merely an even length cycle.
The following are my questions:
Does any graph theory concept suggest this game? Is there a standard game of this sort? Can we come up with a winning strategy for any player for the general graph? My guess is this game may be a version of game of Nim over graphs, I am not sure though.