{
  "id": "1009.3754",
  "version": "v2",
  "published": "2010-09-20T10:06:23.000Z",
  "updated": "2011-03-31T19:48:35.000Z",
  "title": "Hamilton cycles in 5-connected line graphs",
  "authors": [
    "Tomáš Kaiser",
    "Petr Vrána"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2011-03-31T19:48:35.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C45"
    ],
    "keywords": [
      "line graph",
      "hamilton cycles",
      "carsten thomassen states",
      "conjecture",
      "hamiltonian"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1009.3754K"
    }
  }
}