The strong game colouring number of directed graphs

DOI10.1016/j.disc.2013.02.001zbMath1261.05065MaRDI QIDQ1945951

Yanyan Li

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

zbMATH Keywords

digraph; planar graph; partial 2-tree; colouring game; marking game

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

05C57: Games on graphs (graph-theoretic aspects)

Related Items

On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs, Game-perfect semiorientations of forests, Miscellaneous Digraph Classes

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