A generalization of \textsc{Arc-Kayles}

DOI10.1007/s00182-018-0639-5zbMath1417.91143arXiv1709.05219OpenAlexW2963745914WikidataQ129162597 ScholiaQ129162597MaRDI QIDQ2002065

Marc Heinrich, Valentin Gledel, Antoine Dailly

Publication date: 11 July 2019

Published in: International Journal of Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

graphscombinatorial gamesArc-Kayles

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Art gallery problem with rook and queen vision ⋮ Unnamed Item

Cites Work

• On the complexity of some two-person perfect-information games
• Combinatorial analysis of a subtraction game on graphs
• Kayles and Nimbers
• A vertex and edge deletion game on graphs
• The Computational Complexity of the Game of Set and Its Theoretical Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of \textsc{Arc-Kayles}