𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The spanning connectivity of line graphs

✍ Scribed by Po-Yi Huang; Lih-Hsing Hsu

Book ID
108052668
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
217 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The connectivity of line-graphs
The connectivity of line-graphs
✍ Gary Chartrand; M. James Stewart πŸ“‚ Article πŸ“… 1969 πŸ› Springer 🌐 English βš– 286 KB
Graphs with prescribed connectivity and
Graphs with prescribed connectivity and line graph connectivity
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

## 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 qu

2-Connected Spanning Subgraphs of Planar
2-Connected Spanning Subgraphs of Planar 3-Connected Graphs
✍ D.W. Barnette πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 278 KB

We prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15 . We give an example of a planar 3 -connected graph with no spanning 2-connected subgraph of maximum valence five. i) 1994 Academic Press, Inc.

Hamilton connectivity of line graphs and
Hamilton connectivity of line graphs and claw-free graphs
✍ Zhiquan Hu; Feng Tian; Bing Wei πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(Ξ½) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≀ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co