Game chromatic number of Cartesian product graphs

The game chromatic number g is considered for the Cartesian product G 2 H of two graphs G and H. Exact values of g(K22H) are determined when H is a path, a cycle, or a complete graph. By using a newly introduced \game of combinations" we show that the game chromatic number is not bounded in the class of Cartesian products of two complete bipartite graphs. This result implies that the game chromatic number g(G2H) is not bounded from above by a function of game chromatic numbers of graphs G and H. An analogous result is derived for the game coloring number of the Cartesian product of graphs. The paper was started during a meeting in Zielona G ora. y Research supported by a PhD grant from Polish Ministry of Science and Higher Education N201

[1]  Hal A. Kierstead,et al.  The game of arboricity , 2008, Discret. Math..

[2]  Gretchen L. Matthews,et al.  Acyclic colorings of products of trees , 2006, Inf. Process. Lett..

[3]  deXuding Zhu.  Game Chromatic Number of Graphs , 1998 .

[4]  Hal A. Kierstead,et al.  Competitive Colorings of Oriented Graphs , 2000, Electron. J. Comb..

[5]  Jaroslav Nesetril,et al.  On the Oriented Game Chromatic Number , 2001, Electron. J. Comb..

[6]  W. Imrich,et al.  Product Graphs: Structure and Recognition , 2000 .

[7]  P. Erdos,et al.  On chromatic number of graphs and set-systems , 1966 .

[8]  József Beck.  Ramsey games , 2002, Discret. Math..

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

[10]  Xuding Zhu,et al.  Game chromatic number of outerplanar graphs , 1999, J. Graph Theory.

[11]  Xuding Zhu,et al.  The Map-Coloring Game , 2007, Am. Math. Mon..

[12]  Xuding Zhu,et al.  Refined activation strategy for the marking game , 2008, J. Comb. Theory B.

[13]  Wayne Goddard,et al.  Acyclic colorings of planar graphs , 1991, Discret. Math..

[14]  Aviezri S. Fraenkel,et al.  Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction , 2012 .

[15]  Xuding Zhu,et al.  A bound for the game chromatic number of graphs , 1999, Discret. Math..

[16]  Stanislav Jendrol',et al.  List coloring of Cartesian products of graphs , 2006, Discret. Math..

[17]  David R. Wood,et al.  Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets , 2007, Electron. Notes Discret. Math..

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

[19]  Xuding Zhu,et al.  Lower bounds for the game colouring number of partial k-trees and planar graphs , 2008, Discret. Math..

[20]  Oleg V. Borodin.  On acyclic colorings of planar graphs , 1979, Discret. Math..