Colouring games on outerplanar graphs and trees

DOI10.1016/j.disc.2008.09.015zbMath1198.05041OpenAlexW2038300167MaRDI QIDQ1025941

Xuding Zhu, Hungyung Chang

Publication date: 23 June 2009

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

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

zbMATH Keywords

acyclic chromatic numberouterplanar graphscolouring game\(f\)-chromatic number\(f\)-game-chromatic number

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• The 6-relaxed game chromatic number of outerplanar graphs
• Colouring graphs with bounded generalized colouring number
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• Marking games and the oriented game chromatic number of partial \(k\)-trees
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• Excluding any graph as a minor allows a low tree-width 2-coloring
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• The game coloring number of pseudo partial \(k\)-trees
• Grad and classes with bounded expansion. I: Decompositions
• Refined activation strategy for the marking game
• Weak acyclic coloring and asymmetric coloring games
• Very asymmetric marking games
• Tree-depth, subgraph coloring and homomorphism bounds
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• Asymmetric graph coloring games
• The relaxed game chromatic number of outerplanar graphs
• Competitive colorings of oriented graphs
• On the oriented game chromatic number

This page was built for publication: Colouring games on outerplanar graphs and trees