Edge-removing games on graphs.

This paper studies three edge-removing games on graphs. In each game, there are two players and a simple graph G at the beginning. The players take turns removing at least one edge of a certain type from the current graph. The one who cannot move loses the game, and the other one, who plays the last move, wins. This paper gives results for these games on some interesting classes of graphs by either computing their Grundy numbers or proposing winning strategies. [ABSTRACT FROM AUTHOR]