{
  "id": "1604.04072",
  "version": "v1",
  "published": "2016-04-14T08:34:22.000Z",
  "updated": "2016-04-14T08:34:22.000Z",
  "title": "Graph Nimors",
  "authors": [
    "Matthew Skala"
  ],
  "comment": "32 pages including appendix, 4 figures",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-04-14T08:34:22.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "G.2.2"
    ],
    "keywords": [
      "graph nimors",
      "players alternately perform graph minor",
      "alternately perform graph minor operations",
      "experimental results",
      "edges remain"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 32,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}