Game colouring of the square of graphs

DOI10.1016/j.disc.2009.02.014zbMath1178.91034OpenAlexW1981455375MaRDI QIDQ1043984

Louis Esperet, 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.014

zbMATH Keywords

planar graphsactivation strategypseudo-partial \(k\)-treesdistance-two colouringgame colouring

Mathematics Subject Classification ID

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

Related Items (4)

The graph distance game and some graph operations ⋮ Game-perfect digraphs ⋮ Coloring games on squares of graphs ⋮ Note on the game colouring number of powers of graphs

Cites Work

• Unnamed Item
• On acyclic colorings of planar graphs
• The game coloring number of planar graphs
• The game coloring number of pseudo partial \(k\)-trees
• Refined activation strategy for the marking game
• Game coloring the Cartesian product of graphs
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• Game chromatic number of Cartesian product graphs

This page was built for publication: Game colouring of the square of graphs