Graphs with prescribed connectivity and line graph connectivity
Douglas C. Bauer, Ralph Tindell · Journal of Graph Theory · 1979
Abstract Chartrand and Stewart have shown that the line graph of an n‐connected graph is itself n‐connected. This paper shows that for every pair of integers m > n > 1 there is a graph of point connectivity n whose line graph has point connectivity m. The corresponding question for line connectivity is also resolved.