𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local structure of 5- and 6-connected graphs

✍ Scribed by S. A. Obraztsova

Book ID
106436602
Publisher
Springer US
Year
2011
Tongue
English
Weight
181 KB
Volume
179
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A local structure theorem on 5-connected
A local structure theorem on 5-connected graphs
✍ Kiyoshi Ando πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 281 KB

## Abstract An edge of a 5‐connected graph is said to be contractible if the contraction of the edge results in a 5‐connected graph. Let __x__ be a vertex of a 5‐connected graph. We prove that if there are no contractible edges whose distance from __x__ is two or less, then either there are two tri

On the hamiltonicity of line graphs of l
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
✍ Richard C. Brewster; Daryl Funk πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

On local connectivity of graphs
On local connectivity of graphs
✍ Lutz Volkmann πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 151 KB

The local connectivity ΞΊ(u, v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as } for all pairs u and v of vertices in G. Let Ξ΄(G) be the minimum degree of G. We call a graph G maximally connected when ΞΊ(G) = Ξ΄