Matthew Skala
Published 2016-04-14Version 1
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.
Comments: 32 pages including appendix, 4 figures
Experimental Results of the Search for Unitals in Projective Planes of Order 25
Haemers' conjecture: an algorithmic perspective
On vertices and facets of combinatorial 2-level polytopes
![QR code for arXiv:1604.04072 [math.CO]](http://oss.arxitics.com/images/favicon.svg)