Path connectivity of line graphs

Yaping Mao

Path connectivity of line graphs

Combinatorics 2016-03-15 v1

Authors: Yaping Mao

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.

Keywords

graph connectivity graph theory dyck paths

Cite

@article{arxiv.1603.03995,
  title  = {Path connectivity of line graphs},
  author = {Yaping Mao},
  journal= {arXiv preprint arXiv:1603.03995},
  year   = {2016}
}

Comments

15 pages. arXiv admin note: substantial text overlap with arXiv:1508.07202, arXiv:1207.1838; text overlap with arXiv:1103.6095 by other authors

Related papers

View all related →