{
  "id": "1512.01324",
  "version": "v1",
  "published": "2015-12-04T06:25:16.000Z",
  "updated": "2015-12-04T06:25:16.000Z",
  "title": "An algorithm for finding Hamiltonian Cycles in Cubic Planar Graphs",
  "authors": [
    "Bohao Yao",
    "Charl Ras",
    "Hamid Mokhtar"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding Hamiltonian cycles in cubic planar graphs. The worst case time complexity of our algorithm is O$(2^n)$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-12-04T06:25:16.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "cubic planar graphs",
      "finding hamiltonian cycles",
      "worst case time complexity",
      "one-to-one correspondence",
      "specific properties"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv151201324Y"
    }
  }
}