论文信息 - Game chromatic number of outerplanar graphs

Game chromatic number of outerplanar graphs

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. c © 1999 John Wiley & Sons, Inc. J Graph Theory 30:

Xuding Zhu | D. J. Guan

[1] Hal A. Kierstead,et al. Planar Graph Coloring with an Uncooperative Partner , 1991, Planar Graphs.

[2] Hans L. Bodlaender. On the Complexity of Some Coloring Games , 1991, Int. J. Found. Comput. Sci..

[3] Xuding Zhu. The game coloring number of pseudo partial k-trees , 2000, Discret. Math..

[4] U. Faigle,et al. On the game chromatic number of some classes of graphs , 1991 .