Game chromatic number of Cartesian product graphs

Abstract

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