Vertex Nim played on graphs

DOI10.1016/j.tcs.2013.11.025zbMath1278.91029arXiv1208.0722OpenAlexW2020150749MaRDI QIDQ385953

Eric Duchêne, Gabriel Renault

Publication date: 13 December 2013

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

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

zbMATH Keywords

graph theorycombinatorial gamesNim

Mathematics Subject Classification ID

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

Related Items

Combinatorial analysis of a subtraction game on graphs ⋮ Unnamed Item ⋮ Building Nim ⋮ On the complexity of the misère version of three games played on graphs

Cites Work

• Geometrical extensions of Wythoff's game
• Geography
• A Nim game played on graphs.
• A Nim game played on graphs. II.
• A new heap game
• Complexity, appeal and challenges of combinatorial games
• Circular Nim games
• A generalization of Wythoff's game
• How to Beat Your Wythoff Games' Opponent on Three Fronts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item