The strong game colouring number of directed graphs
From MaRDI portal
Publication:1945951
DOI10.1016/j.disc.2013.02.001zbMath1261.05065OpenAlexW2048373074MaRDI QIDQ1945951
Publication date: 17 April 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.02.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (3)
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs ⋮ Miscellaneous Digraph Classes ⋮ Game-perfect semiorientations of forests
Cites Work
- Unnamed Item
- Unnamed Item
- Activation strategy for asymmetric marking games
- Lightness of digraphs in surfaces and directed game chromatic number
- A bound for the game chromatic number of graphs
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- Orderings on graphs and game coloring number
- The game coloring number of pseudo partial \(k\)-trees
- Game colouring directed graphs
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
- Refined activation strategy for the marking game
- Asymmetric marking games on line graphs
- Weak acyclic coloring and asymmetric coloring games
- Very asymmetric marking games
- Game chromatic index ofk-degenerate graphs
- Game coloring the Cartesian product of graphs
- Game chromatic number of outerplanar graphs
- Radius two trees specify χ‐bounded classes
- Asymmetric graph coloring games
- The Map-Coloring Game
This page was built for publication: The strong game colouring number of directed graphs
