Learn More
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of G are colored. The game chromatic number χ g (G) is the minimum k for which the first player has a winning strategy. The paper(More)
  • 1