Circular game chromatic number of graphs

DOI10.1016/j.disc.2009.02.011zbMath1178.91035OpenAlexW2081276927MaRDI QIDQ1043981

Wensong Lin, Xuding Zhu

Publication date: 10 December 2009

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

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

zbMATH Keywords

planar graphsgraphsacyclic chromatic numberforestsgame colouring numbercircular game chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• The game coloring number of pseudo partial \(k\)-trees
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• Very asymmetric marking games
• Efficient Graph Packing via Game Colouring
• Game coloring the Cartesian product of graphs
• Star chromatic number
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• The Map-Coloring Game
• Circular chromatic number: A survey

This page was built for publication: Circular game chromatic number of graphs