Given a finite undirected graph \(G\), players alternate turns and remove either a single edge or a vertex with all incident edges. Whoever removes the last vertex, leaving their opponent with the empty graph, wins. Which player has a winning strategy for games on trees, forests, cycle graphs, complete graphs, etc?