Weak acyclic coloring and asymmetric coloring games

DOI10.1016/j.disc.2004.07.042zbMath1091.05025MaRDI QIDQ2488942

Henry A. Kierstead

Publication date: 16 May 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.042

zbMATH Keywords

acyclic chromatic number; game chromatic number

Mathematics Subject Classification ID

91A43: Games involving graphs

05C15: Coloring of graphs and hypergraphs

Related Items

Colouring games on outerplanar graphs and trees, Activation strategy for relaxed asymmetric coloring games, Asymmetric marking games on line graphs, Very asymmetric marking games, Game coloring the Cartesian product of graphs

Cites Work

• Unnamed Item
• On acyclic colorings of planar graphs
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• Good and semi-strong colorings of oriented planar graphs
• Marking games and the oriented game chromatic number of partial \(k\)-trees
• A simple competitive graph coloring algorithm
• Coloring with no 2-colored \(P_4\)'s
• The game coloring number of pseudo partial \(k\)-trees
• Refined activation strategy for the marking game
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Radius two trees specify χ‐bounded classes
• Asymmetric graph coloring games
• Acyclic colorings of planar graphs
• Competitive colorings of oriented graphs
• On the oriented game chromatic number