{
  "id": "1206.4846",
  "version": "v1",
  "published": "2012-06-21T11:57:48.000Z",
  "updated": "2012-06-21T11:57:48.000Z",
  "title": "Hamiltonian Cycles in the Square of a Graph",
  "authors": [
    "Jan Ekstein"
  ],
  "comment": "16 pages",
  "journal": "The Electronic Journal of Combinatorics Volume 18, Issue 1 (2011), #P203",
  "categories": [
    "math.CO"
  ],
  "abstract": "We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a cut vertex and any two these vertices are at distance at least four.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-06-21T11:57:48.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C45"
    ],
    "keywords": [
      "hamiltonian cycles",
      "block graph corresponds",
      "sufficient conditions",
      "cut vertex",
      "hamiltonian square"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1206.4846E"
    }
  }
}