Path connectivity of line graphs
Abstract
Dirac showed that in a (k-1)-connected graph there is a path through each k vertices. The path k-connectivity π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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.