Lesson plan

Graph coloring game

vertices of the graph. If the graph is fully colored properly at the end, Alice wins. If at any point there is a vertex that becomes impossible to properly color, Bob wins. The game chromatic number \chi_g(G) is the minimum number of colors needed for Alice to win the vertex coloring game on G . For this graph, \chi_g(G)=3 , as it is the Cartesian product S_5 \square P_2 The graph coloring game is a mathematical game related to graph theory. Coloring game problems arose as game-theoretic versions of well-known graph coloring problems. In a coloring game, two players use a given set of colors to construct a coloring of a graph, following specific rules depending on the game we consider. One player tries to successfully complete the coloring of the graph, while the other one tries to prevent him from achieving it.

Back to article

Article summary

vertices of the graph. If the graph is fully colored properly at the end, Alice wins. If at any point there is a vertex that becomes impossible to properly color, Bob wins. The game chromatic number \chi_g(G) is the minimum number of colors needed for Alice to win the vertex coloring game on G . For this graph, \chi_g(G)=3 , as it is the Cartesian product S_5 \square P_2 The graph coloring game is a mathematical game related to graph theory. Coloring game problems arose as game-theoretic versions of well-known graph coloring problems. In a coloring game, two players use a given set of colors to construct a coloring of a graph, following specific rules depending on the game we consider. One player tries to successfully complete the coloring of the graph, while the other one tries to prevent him from achieving it.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.