𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs

✍ Scribed by Liming Xiong; Roman Kužel

Publisher
Springer Japan
Year
2005
Tongue
English
Weight
274 KB
Volume
21
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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