{
  "id": "1409.2440",
  "version": "v1",
  "published": "2014-09-08T17:40:01.000Z",
  "updated": "2014-09-08T17:40:01.000Z",
  "title": "A computer-assisted proof of a Barnette's conjecture: Not only fullerene graphs are hamiltonian",
  "authors": [
    "František Kardoš"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Fullerene graphs, i.e., 3-connected planar cubic graphs with pentagonal and hexagonal faces, are conjectured to be hamiltonian. This is a special case of a conjecture of Barnette, dating back to the 60s, stating that 3-connected planar graphs with faces of size at most 6 are hamiltonian. We prove the conjecture.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-09-08T17:40:01.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "fullerene graphs",
      "barnettes conjecture",
      "computer-assisted proof",
      "hamiltonian",
      "planar cubic graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1409.2440K"
    }
  }
}