### Abstract

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) <2 and determine the game choice number for some classes of graphs.

Original language | English |
---|---|

Pages (from-to) | 1-11 |

Number of pages | 11 |

Journal | Electronic Journal of Combinatorics |

Volume | 14 |

Issue number | 1 R |

Publication status | Published - Mar 22 2007 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics

### Cite this

*Electronic Journal of Combinatorics*,

*14*(1 R), 1-11.

**Game list colouring of graphs.** / Borowiecki, M.; Sidorowicz, E.; Tuza, Z.

Research output: Contribution to journal › Article

*Electronic Journal of Combinatorics*, vol. 14, no. 1 R, pp. 1-11.

}

TY - JOUR

T1 - Game list colouring of graphs

AU - Borowiecki, M.

AU - Sidorowicz, E.

AU - Tuza, Z.

PY - 2007/3/22

Y1 - 2007/3/22

N2 - 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 chg(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 chg(G) <2 and determine the game choice number for some classes of graphs.

AB - 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 chg(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 chg(G) <2 and determine the game choice number for some classes of graphs.

UR - http://www.scopus.com/inward/record.url?scp=33947668376&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947668376&partnerID=8YFLogxK

M3 - Article

VL - 14

SP - 1

EP - 11

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 1 R

ER -