Graph Nimors
classification
🧮 math.CO
keywords
graphedgesgamenimorsalternatelyconjecturescontractiondeletion
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.