Game coloring the Cartesian product of graphs
作者：
DOI: 10.1002/JGT.V59:4
关键词: Combinatorics 、 Discrete mathematics 、 Vertex (graph theory) 、 Critical graph 、 Cartesian product of graphs 、 Cartesian product 、 Brooks' theorem 、 Mathematics 、 Planar graph 、 Edge coloring 、 Graph coloring
摘要: This article proves the following result: Let G and G′ be graphs of orders n n′, respectively. G* obtained from by adding to each vertex a set n′ degree 1 neighbors. If has game coloring number m acyclic chromatic k, then Cartesian product GsG′ at most k(k + m - 1). As consequence, two forests 10, planar 105. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 261–278,
nsysu.edu.tw 
sci-hub.st 参考文章(29)
Walter Kern, H. Kierstead, W.T. Trotter, U. Faigle, On the game chromatic number of some classes of graphs Ars Combinatoria. ,vol. 35, pp. 143- 150 ,(1993)
T. Bartnicki, B. Brešar, J. Grytczuk, M. Kovše, Z. Miechowicz, I. Peterin, Game Chromatic Number of Cartesian Product Graphs Electronic Journal of Combinatorics. ,vol. 15, pp. 72- ,(2008) , 10.37236/796
M. Borowiecki, E. Sidorowicz, Zs. Tuza, Game list colouring of graphs Electronic Journal of Combinatorics. ,vol. 14, pp. 26- ,(2007) , 10.37236/944
Yuqin Sun, Yusheng Li, A Bound for Size Ramsey Numbers of Multi-partite Graphs Electronic Journal of Combinatorics. ,vol. 14, pp. 11- ,(2007) , 10.37236/1012
O.V. Borodin, On acyclic colorings of planar graphs Discrete Mathematics. ,vol. 306, pp. 953- 972 ,(2006) , 10.1016/J.DISC.2006.03.017
H. A. Kierstead, Daqing Yang, Orderings on graphs and game coloring number Order. ,vol. 20, pp. 255- 264 ,(2003) , 10.1023/B:ORDE.0000026489.93166.CB
Ko-Wei Lih, Xuding Zhu, Jiating Shao, Xiaoling Hou, Wenjie He, Weifan Wang, Edge-partitions of planar graphs and their game coloring numbers Journal of Graph Theory. ,vol. 41, pp. 307- 317 ,(2002) , 10.1002/JGT.V41:4
HANS L. BODLAENDER, ON THE COMPLEXITY OF SOME COLORING GAMES International Journal of Foundations of Computer Science. ,vol. 02, pp. 133- 147 ,(1991) , 10.1142/S0129054191000091
D. J. Guan, Xuding Zhu, Game chromatic number of outerplanar graphs Journal of Graph Theory. ,vol. 30, pp. 67- 70 ,(1999) , 10.1002/(SICI)1097-0118(199901)30:1<>1.0.CO;2-K
Xuding Zhu, The Game Coloring Number of Planar Graphs Journal of Combinatorial Theory, Series B. ,vol. 75, pp. 245- 258 ,(1999) , 10.1006/JCTB.1998.1878