There is a graph with n vertexes and m edges. Two players are playing a game on this graph.The first player colors a vertex and the second player can color only one of the neighbors of the vertex which was colored first.After that, the first player can color one of the neighbors of the vertex which was chosen by the second one, and so on.Formaly, a player can only color a neighbor to the vertex colored last by the other player. The player who can't color a vertex anymore wins. The question is that if the first player has a strategy to win. I've solved this problem if the graph is a tree using a DP but I can't see any connections between the tree problem and this one Thank you in advance!