{
  "id": "2001.00042",
  "version": "v1",
  "published": "2019-12-31T19:11:06.000Z",
  "updated": "2019-12-31T19:11:06.000Z",
  "title": "The hamiltonicity of essentially 9-connected line graphs",
  "authors": [
    "Tomáš Kaiser",
    "Petr Vrána"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Yang et al. proved that every 3-connected, essentially 11-connected line graph is Hamilton-connected. This was extended by Li and Yang to 3-connected, essentially 10-connected graphs. Strengthening their result further, we prove that 3-connected, essentially 9-connected line graphs are Hamilton-connected. We use a method based on quasigraphs in combination with the discharging technique. The result extends to claw-free graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-12-31T19:11:06.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C45"
    ],
    "keywords": [
      "line graph",
      "hamiltonicity",
      "result extends",
      "claw-free graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}