Graph Nimors
Combinatorics
2016-04-15 v1
Abstract
In the game of Graph Nimors, two players alternately perform graph minor operations (deletion and contraction of edges) on a graph until no edges remain, at which point the player who last moved wins. We present theoretical and experimental results and conjectures regarding this game.
Keywords
Cite
@article{arxiv.1604.04072,
title = {Graph Nimors},
author = {Matthew Skala},
journal= {arXiv preprint arXiv:1604.04072},
year = {2016}
}
Comments
32 pages including appendix, 4 figures