Notes on the combinatorial game: graph Nim

Abstract

The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama. In this paper, we focus on the version of Nim played on graphs which was introduced by N.J. Calkin et al.: Two players alternate turns, each time choosing a vertex $v$ of a finite graph and removing any number $(\geq 1)$ of edges incident to $v$. The player who cannot make a move loses the game. Here, we analyze Graph Nim for various classes of graphs and also compute some Grundy-values

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

https://doaj.org/toc/2338-2287 (external link)

http://ejgta.org/index.php/ejg... (external link)

https://doaj.org/article/bc276... (external link)