Game list colouring of graphs

M. Borowiecki, E. Sidorowicz, Z. Tuza

Research output: Contribution to journalArticle

9 Citations (Scopus)

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 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.

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalElectronic Journal of Combinatorics
Volume14
Issue number1 R
Publication statusPublished - Mar 22 2007

Fingerprint

List Coloring
Coloring
Game
Color
Graph in graph theory
Assignment
Colouring
Adjacent
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Borowiecki, M., Sidorowicz, E., & Tuza, Z. (2007). Game list colouring of graphs. Electronic Journal of Combinatorics, 14(1 R), 1-11.

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

In: Electronic Journal of Combinatorics, Vol. 14, No. 1 R, 22.03.2007, p. 1-11.

Research output: Contribution to journalArticle

Borowiecki, M, Sidorowicz, E & Tuza, Z 2007, 'Game list colouring of graphs', Electronic Journal of Combinatorics, vol. 14, no. 1 R, pp. 1-11.
Borowiecki M, Sidorowicz E, Tuza Z. Game list colouring of graphs. Electronic Journal of Combinatorics. 2007 Mar 22;14(1 R):1-11.
Borowiecki, M. ; Sidorowicz, E. ; Tuza, Z. / Game list colouring of graphs. In: Electronic Journal of Combinatorics. 2007 ; Vol. 14, No. 1 R. pp. 1-11.
@article{ecc3c9036f024ea1be50c8d442dec5d1,
title = "Game list colouring of graphs",
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 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.",
author = "M. Borowiecki and E. Sidorowicz and Z. Tuza",
year = "2007",
month = "3",
day = "22",
language = "English",
volume = "14",
pages = "1--11",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "1 R",

}

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 -