Asymmetric graph coloring games

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

We introduce the (a, b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a, b)-marking game. We analyze these games and determine the (a, b)chromatic numbers and (a, b)-coloring numbers for the class of forests and all Values of a and b.

Original languageEnglish (US)
Pages (from-to)169-185
Number of pages17
JournalJournal of Graph Theory
Volume48
Issue number3
DOIs
StatePublished - Mar 2005

Fingerprint

Graph Coloring
Game
Colouring
Finite Graph
Chromatic number
Color

Keywords

  • Asymmetric
  • Game chromatic number
  • Game coloring number

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Asymmetric graph coloring games. / Kierstead, Henry.

In: Journal of Graph Theory, Vol. 48, No. 3, 03.2005, p. 169-185.

Research output: Contribution to journalArticle

Kierstead, Henry. / Asymmetric graph coloring games. In: Journal of Graph Theory. 2005 ; Vol. 48, No. 3. pp. 169-185.
@article{bdd3138cf43145f1b0065aa112f72e45,
title = "Asymmetric graph coloring games",
abstract = "We introduce the (a, b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a, b)-marking game. We analyze these games and determine the (a, b)chromatic numbers and (a, b)-coloring numbers for the class of forests and all Values of a and b.",
keywords = "Asymmetric, Game chromatic number, Game coloring number",
author = "Henry Kierstead",
year = "2005",
month = "3",
doi = "10.1002/jgt.20049",
language = "English (US)",
volume = "48",
pages = "169--185",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "3",

}

TY - JOUR

T1 - Asymmetric graph coloring games

AU - Kierstead, Henry

PY - 2005/3

Y1 - 2005/3

N2 - We introduce the (a, b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a, b)-marking game. We analyze these games and determine the (a, b)chromatic numbers and (a, b)-coloring numbers for the class of forests and all Values of a and b.

AB - We introduce the (a, b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a, b)-marking game. We analyze these games and determine the (a, b)chromatic numbers and (a, b)-coloring numbers for the class of forests and all Values of a and b.

KW - Asymmetric

KW - Game chromatic number

KW - Game coloring number

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

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

U2 - 10.1002/jgt.20049

DO - 10.1002/jgt.20049

M3 - Article

AN - SCOPUS:14644425928

VL - 48

SP - 169

EP - 185

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 3

ER -