Two players are presented with a finite, simple graph that has no isolated vertices. They take turns deleting an edge from the graph in such a way that no isolated vertex is created. The winner is the last player able to remove an edge. We analyze this game when the graph is a path of arbitrary length. In addition, some observations are made in the situation that the graph has an automorphism of a special type.
