  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.
