Weak acyclic coloring and asymmetric coloring games

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

We introduce the notion of weak acyclic coloring of a graph. This is a relaxation of the usual notion of acyclic coloring which is often sufficient for applications. We then use this concept to analyze the ( a, b )-coloring game. This game is played on a finite graph G, using a set of colors X, by two players Alice and Bob with Alice playing first. On each turn Alice (Bob) chooses a (b) uncolored vertices and properly colors them with colors from X. Alice wins if the players eventually create a proper coloring of G; otherwise Bob wins when one of the players has no legal move. The ( a, b )-game chromatic number of G, denoted ( a, b )- χg ( G ), is the least integer t such that Alice has a winning strategy when the game is played on G using t colors. We show that if the weak acyclic chromatic number of G is at most k then ( 2, 1 )- χg ( G ) {less-than or slanted equal to} frac(1, 2) ( k2 + 3 k ).

Original languageEnglish (US)
Pages (from-to)673-677
Number of pages5
JournalDiscrete Mathematics
Volume306
Issue number7
DOIs
StatePublished - Apr 28 2006

Fingerprint

Acyclic Coloring
Coloring
Colouring
Game
Color
Game Chromatic number
Finite Graph
Less than or equal to
Chromatic number
Choose
Sufficient
Integer
Graph in graph theory

Keywords

  • Acyclic chromatic number
  • Game chromatic number

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Weak acyclic coloring and asymmetric coloring games. / Kierstead, Henry.

In: Discrete Mathematics, Vol. 306, No. 7, 28.04.2006, p. 673-677.

Research output: Contribution to journalArticle

@article{f6df0cd6635c40838515194b3eb3c15e,
title = "Weak acyclic coloring and asymmetric coloring games",
abstract = "We introduce the notion of weak acyclic coloring of a graph. This is a relaxation of the usual notion of acyclic coloring which is often sufficient for applications. We then use this concept to analyze the ( a, b )-coloring game. This game is played on a finite graph G, using a set of colors X, by two players Alice and Bob with Alice playing first. On each turn Alice (Bob) chooses a (b) uncolored vertices and properly colors them with colors from X. Alice wins if the players eventually create a proper coloring of G; otherwise Bob wins when one of the players has no legal move. The ( a, b )-game chromatic number of G, denoted ( a, b )- χg ( G ), is the least integer t such that Alice has a winning strategy when the game is played on G using t colors. We show that if the weak acyclic chromatic number of G is at most k then ( 2, 1 )- χg ( G ) {less-than or slanted equal to} frac(1, 2) ( k2 + 3 k ).",
keywords = "Acyclic chromatic number, Game chromatic number",
author = "Henry Kierstead",
year = "2006",
month = "4",
day = "28",
doi = "10.1016/j.disc.2004.07.042",
language = "English (US)",
volume = "306",
pages = "673--677",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - Weak acyclic coloring and asymmetric coloring games

AU - Kierstead, Henry

PY - 2006/4/28

Y1 - 2006/4/28

N2 - We introduce the notion of weak acyclic coloring of a graph. This is a relaxation of the usual notion of acyclic coloring which is often sufficient for applications. We then use this concept to analyze the ( a, b )-coloring game. This game is played on a finite graph G, using a set of colors X, by two players Alice and Bob with Alice playing first. On each turn Alice (Bob) chooses a (b) uncolored vertices and properly colors them with colors from X. Alice wins if the players eventually create a proper coloring of G; otherwise Bob wins when one of the players has no legal move. The ( a, b )-game chromatic number of G, denoted ( a, b )- χg ( G ), is the least integer t such that Alice has a winning strategy when the game is played on G using t colors. We show that if the weak acyclic chromatic number of G is at most k then ( 2, 1 )- χg ( G ) {less-than or slanted equal to} frac(1, 2) ( k2 + 3 k ).

AB - We introduce the notion of weak acyclic coloring of a graph. This is a relaxation of the usual notion of acyclic coloring which is often sufficient for applications. We then use this concept to analyze the ( a, b )-coloring game. This game is played on a finite graph G, using a set of colors X, by two players Alice and Bob with Alice playing first. On each turn Alice (Bob) chooses a (b) uncolored vertices and properly colors them with colors from X. Alice wins if the players eventually create a proper coloring of G; otherwise Bob wins when one of the players has no legal move. The ( a, b )-game chromatic number of G, denoted ( a, b )- χg ( G ), is the least integer t such that Alice has a winning strategy when the game is played on G using t colors. We show that if the weak acyclic chromatic number of G is at most k then ( 2, 1 )- χg ( G ) {less-than or slanted equal to} frac(1, 2) ( k2 + 3 k ).

KW - Acyclic chromatic number

KW - Game chromatic number

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

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

U2 - 10.1016/j.disc.2004.07.042

DO - 10.1016/j.disc.2004.07.042

M3 - Article

AN - SCOPUS:33645885912

VL - 306

SP - 673

EP - 677

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 7

ER -