𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonicity of 3-connected line graphs

✍ Scribed by Weihua Yang; Liming Xiong; Hongjian Lai; Xiaofeng Guo

Book ID
116217586
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
199 KB
Volume
25
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonicity of 4-connected graphs
Hamiltonicity of 4-connected graphs
✍ Hao Li; Feng Tian; Zhi Xia Xu πŸ“‚ Article πŸ“… 2010 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 230 KB
Hamiltonicity of regular 2-connected gra
Hamiltonicity of regular 2-connected graphs
✍ Broersma, H. J.; van den Heuvel, J.; Jackson, B.; Veldman, H. J. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 832 KB

Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Zhu and Li showed that the upper bound 3k on n can be relaxed to q k if G is 3-connected and k 2 63. We improve both results by showing that G is hamiltonian if n 5 gk -7 and G does not belong to a res

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