{
  "id": "0906.5053",
  "version": "v1",
  "published": "2009-06-27T09:10:44.000Z",
  "updated": "2009-06-27T09:10:44.000Z",
  "title": "Large cycles in 4-connected graphs",
  "authors": [
    "M. Zh. Nikoghosyan",
    "Zh. G. Nikoghosyan"
  ],
  "comment": "4 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "Every 4-connected graph $G$ with minimum degree $\\delta$ and connectivity $\\kappa$ either contains a cycle of length at least $4\\delta-\\kappa-4$ or every longest cycle in $G$ is a dominating cycle.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-06-27T09:10:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C38",
      "05C40"
    ],
    "keywords": [
      "large cycles",
      "minimum degree",
      "longest cycle"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0906.5053N"
    }
  }
}