The game chromatic number and the game colouring number of cactuses

DOI10.1016/j.ipl.2006.12.003zbMath1185.91058OpenAlexW1998136751MaRDI QIDQ845991

Elżbieta Sidorowicz

Publication date: 29 January 2010

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

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

zbMATH Keywords

combinatorial problemsgame chromatic numbercompetitive algorithmsgame coloring number

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (14)

The graph distance game and some graph operations ⋮ PSPACE-hardness of two graph coloring games ⋮ Unnamed Item ⋮ On a vertex-edge marking game on graphs ⋮ PSPACE-completeness of two graph coloring games ⋮ Game-perfect digraphs ⋮ Game chromatic number of graphs with locally bounded number of cycles ⋮ The game chromatic number and the game colouring number of classes of oriented cactuses ⋮ On monotonicity in maker-breaker graph colouring games ⋮ The complexity of two colouring games ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ The eternal game chromatic number of random graphs ⋮ Infinite chromatic games ⋮ \textsf{PSPACE}-hardness of variants of the graph coloring game

Cites Work

• Unnamed Item
• Unnamed Item
• The game coloring number of planar graphs
• Marking games and the oriented game chromatic number of partial \(k\)-trees
• The game coloring number of pseudo partial \(k\)-trees
• Refined activation strategy for the marking game
• GO Is Polynomial-Space Hard
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• 25 pretty graph colouring problems
• Competitive colorings of oriented graphs
• On the oriented game chromatic number

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