Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs

DOI10.1016/j.disc.2007.05.023zbMath1142.05032MaRDI QIDQ2427530

Xuding Zhu, Jiaojiao Wu

Publication date: 13 May 2008

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

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

zbMATH Keywords

planar graphs; games; coloring number; partial trees

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

91A05: 2-person games

91A43: Games involving graphs

05C15: Coloring of graphs and hypergraphs

Related Items

Game chromatic number of Cartesian product graphs, Game chromatic number of toroidal grids, The game chromatic index of wheels, Activation strategy for relaxed asymmetric coloring games, Circular game chromatic number of graphs, Refined activation strategy for the marking game, Very asymmetric marking games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• The game coloring number of pseudo partial \(k\)-trees
• Refined activation strategy for the marking game
• Very asymmetric marking games
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Radius two trees specify χ‐bounded classes
• Edge-partitions of planar graphs and their game coloring numbers