Url
	https://wou.omeka.net/s/pure-insights/item/114
Title
	Graph Nim
Creator
	Breeann Flesch
	Akaanchya Pradhan
Subject
	Discrete Mathematics and Combinatorics
	Graph Nim
	Impartial Combinatorial Game
	Two-player game
Date
	5/29/2015
Type
	Text
Identifier
	pure/vol4/iss1/3
Language
	eng
Rights
	Western Oregon University Library has determined, as of 06/01/2023, this item is in copyright, which is held by the author. Users may use the item in accordance with copyright limitations and exceptions, including fair use. For other uses, please ask permission from the author.
	http://rightsstatements.org/vocab/InC/1.0/
Alternative Title
	Graph Nim
Abstract
	Nim is a well-known two-player impartial combinatorial game. Various versions of playing Nim on graphs have been investigated. We investigate a new version of Nim called Graph Nim. Given a graph with n vertices and multiple edges, players take turns removing edges until there are no edges left. Players have to choose a vertex and remove at least one edge incident to the chosen vertex. The player that removes the last edge or edges wins the game. In this paper, we give the solution for certain game boards of Graph Nim, compare the game of Graph Nim to another impartial combinatorial game, and discuss open problems.
Volume
	4
Supported by
	Breeann Flesch
Note
	Breeann Flesch

--