Next: About this document ...
THE GRAPH COLORING GAME
This is a collection of papers about the Graph Coloring Game.
It is not complete.
- Planar Graph Coloring with an Uncooperative Partner by Kierstead and Trotter.
This paper shows that the game chromatic number of a planar graph is less than or equal to 33.
- A New Game Chromatic Number by Chen, Schelp, Shreve
This paper shows that the game chromatic number of a tree is less than or equal to 3.
- Graphs with Linearly Bounded Ramsey Numbers.
This paper, combined with the activation strategy, shows that there is a
constant that bounds the game chromatic number of any planar graph.
- The Map Coloring Game by Bartnicki, Grytezhuk, Kiestead, Zhu.
This paper summarizes the progress on planar graphs and shows
that all planar graphs have chromatic number at most 18.