{
  "id": "0905.1394",
  "version": "v1",
  "published": "2009-05-09T10:09:44.000Z",
  "updated": "2009-05-09T10:09:44.000Z",
  "title": "On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$",
  "authors": [
    "Zh. G. Nikoghosyan"
  ],
  "comment": "9 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Two sharp lower bounds for the length of a longest cycle $C$ of a graph $G$ are presented in terms of the lengths of a longest path and a longest cycle of $G-C$, denoted by $\\overline{p}$ and $\\overline{c}$, respectively, combined with minimum degree $\\delta$: (1) $|C|\\geq(\\overline{p}+2)(\\delta-\\overline{p})$ and (2) $|C|\\geq(\\overline{c}+1)(\\delta-\\overline{c}+1)$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-05-09T10:09:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C38"
    ],
    "keywords": [
      "longest cycle",
      "structures",
      "sharp lower bounds",
      "longest path"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0905.1394N"
    }
  }
}