Note on the game colouring number of powers of graphs
From MaRDI portal
Publication:907829
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
Related Items (1)
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