Game List Colouring of Graphs

We consider the two-player game defined as follows. Let $(G,L)$ be a graph $G$ with a list assignment $L$ on its vertices. The two players, Alice and Bob, play alternately on $G$, Alice having the first move. Alice's goal is to provide an $L$-colouring of $G$ and Bob's goal is to prevent her from doing so. A move consists in choosing an uncoloured vertex $v$ and assigning it a colour from the set $L(v)$. Adjacent vertices of the same colour must not occur. This game will be called game list colouring . The game choice number of $G$, denoted by ch$_g(G)$, is defined as the least $k$ such that Alice has a winning strategy for any $k$-list assignment of $G$. We characterize the class of graphs with ch$_g(G)\le 2$ and determine the game choice number for some classes of graphs.

[1]  Carsten Thomassen,et al.  Color-Critical Graphs on a Fixed Surface , 1997, J. Comb. Theory, Ser. B.

[2]  Alexandr V. Kostochka,et al.  The colour theorems of Brooks and Gallai extended , 1996, Discret. Math..

[3]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

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

[5]  Hal A. Kierstead,et al.  A Simple Competitive Graph Coloring Algorithm , 2000, J. Comb. Theory B.

[6]  Zsolt Tuza,et al.  Marking Games and the Oriented Game Chromatic Number of Partial k-Trees , 2003, Graphs Comb..

[7]  Xuding Zhu,et al.  Game chromatic index of k-degenerate graphs , 2001, J. Graph Theory.

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

[9]  Ewa Drgas-Burchardt,et al.  Generalized list colourings of graphs , 1995, Discuss. Math. Graph Theory.

[10]  Zsolt Tuza,et al.  Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.

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

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

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

[14]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[15]  Hal A. Kierstead,et al.  A simple competitive graph coloring algorithm III , 2004, J. Comb. Theory B.