Impartial coloring games

DOI10.1016/J.TCS.2013.02.032zbMath1297.05160arXiv1202.5762OpenAlexW1970607503MaRDI QIDQ388789

Mohammad Hasan, H. S. Yoon

Publication date: 7 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.5762

zbMATH Keywords

graph coloringcombinatorial gamesSprague-Grundy function

Mathematics Subject Classification ID

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

Related Items (4)

Proper 2-coloring game on some trees ⋮ The complexity of two colouring games ⋮ Unnamed Item ⋮ The orthogonal colouring game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic and \(k\)-distance coloring of the grid
• Compound Node-Kayles on paths
• On the complexity of some two-person perfect-information games
• A bound for the game chromatic number of graphs
• Complexity, appeal and challenges of combinatorial games
• Exact Algorithms for Kayles
• Kayles and Nimbers
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Randomized online graph coloring
• The Map-Coloring Game
• On the oriented game chromatic number

This page was built for publication: Impartial coloring games