Game chromatic number of toroidal grids

DOI10.1016/j.endm.2009.07.063zbMath1273.05080OpenAlexW2037421440MaRDI QIDQ5891223

Jiaojiao Wu, Andre Raspaud

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.063

zbMATH Keywords

cyclesCartesian productgame chromatic numbergame coloring numbertoroidal gridstoroidal grid graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• 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
• Game coloring the Cartesian product of graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• The Map-Coloring Game
• Game chromatic number of Cartesian product graphs