Journal of Graph Theory · 1999 · 81 citations · 4 references
This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 67–70, 1999
4
On the game chromatic number of some classes of graphs
Ulrich Faigle, Walter Kern, H. A. Kierstead et al. · University of Twente Research Information · 1991 · 144 citations · Full text
Planar graph coloring with an uncooperative partner
H. A. Kierstead, W. T. Trotter · Journal of Graph Theory · 1994 · 140 citations
The game coloring number of pseudo partial k-trees
Xuding Zhu · Discrete Mathematics · 2000 · 78 citations