{
  "id": "1603.03995",
  "version": "v1",
  "published": "2016-03-13T04:56:15.000Z",
  "updated": "2016-03-13T04:56:15.000Z",
  "title": "Path connectivity of line graphs",
  "authors": [
    "Yaping Mao"
  ],
  "comment": "15 pages. arXiv admin note: substantial text overlap with arXiv:1508.07202, arXiv:1207.1838; text overlap with arXiv:1103.6095 by other authors",
  "categories": [
    "math.CO"
  ],
  "abstract": "Dirac showed that in a $(k-1)$-connected graph there is a path through each $k$ vertices. The path $k$-connectivity $\\pi_k(G)$ of a graph $G$, which is a generalization of Dirac's notion, was introduced by Hager in 1986. In this paper, we study path connectivity of line graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-03-13T04:56:15.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "line graphs",
      "study path connectivity",
      "diracs notion",
      "connected graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160303995M"
    }
  }
}