Asymmetric directed graph coloring games

DOI10.1016/j.disc.2008.03.022zbMath1177.91054OpenAlexW2002778055MaRDI QIDQ1045076

Stephan Dominique Andres

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.022

zbMATH Keywords

surfacegirthgame chromatic numberforestouterplanar graphgame coloring numberdirected graph coloring game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Game-perfect digraphs ⋮ Directed defective asymmetric graph coloring games ⋮ Colouring games based on autotopisms of Latin hyper-rectangles ⋮ Miscellaneous Digraph Classes ⋮ Game-perfect semiorientations of forests

Cites Work

• Unnamed Item
• Lightness of digraphs in surfaces and directed game chromatic number
• The game coloring number of planar graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Asymmetric graph coloring games
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: Asymmetric directed graph coloring games