Note on the game colouring number of powers of graphs

DOI10.7151/dmgt.1841zbMath1329.05100OpenAlexW2578835255MaRDI QIDQ907829

Andrea Theuser, Stephan Dominique Andres

Publication date: 26 January 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1841

zbMATH Keywords

game chromatic numberforestgraph powergame colouring numbermarking game

Mathematics Subject Classification ID

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

Related Items (1)

On a vertex-edge marking game on graphs

Cites Work

• Unnamed Item
• Coloring games on squares of graphs
• Game colouring of the square of graphs
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• 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
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Radius two trees specify χ‐bounded classes
• Coloring Powers of Planar Graphs
• The Map-Coloring Game
• On chromatic number of graphs and set-systems

This page was built for publication: Note on the game colouring number of powers of graphs