The game chromatic number and the game colouring number of classes of oriented cactuses

DOI10.1016/J.IPL.2010.11.020zbMath1260.91037OpenAlexW2146031995MaRDI QIDQ1944077

Stephan Dominique Andres, Winfried Hochstättler

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.020

zbMATH Keywords

combinatorial problemsgraph algorithmsgame chromatic numbergame colouring numberdigraph colouring game

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

The coloring game on planar graphs with large girth, by a result on sparse cactuses

Cites Work

• Unnamed Item
• The game chromatic number and the game colouring number of cactuses
• Lightness of digraphs in surfaces and directed game chromatic number
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• Refined activation strategy for the marking game
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Edge-partitions of planar graphs and their game coloring numbers
• On the oriented game chromatic number

This page was built for publication: The game chromatic number and the game colouring number of classes of oriented cactuses