𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

✍ Scribed by Richard C. Brewster; Daryl Funk

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
124 KB
Volume
71
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 weaker version of this result for infinite graphs: The line graph of locally finite, 6‐edge‐connected graph with a finite number of ends, each of which is thin, is hamiltonian.

πŸ“œ SIMILAR VOLUMES

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

On the Edge Connectivity, Hamiltonicity,
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs
✍ Jan van den Heuvel; Bill Jackson πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GΓ‚E(F ) is

On the edge-connectivity vector of a gra
On the edge-connectivity vector of a graph
✍ Linda M. Lesniak; Raymond E. Pippert πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 202 KB
On bounded automorphisms of locally fini
On bounded automorphisms of locally finite transitive graphs
✍ Niemeyer, Peter πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co

The number of connected sparsely edged g
The number of connected sparsely edged graphs
✍ E. M. Wright πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^nβˆ’2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp