✦ LIBER ✦

Hamilton cycles in regular 2-connected graphs

✍ Scribed by Bill Jackson

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 968 KB
Volume: 29
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(80)90042-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton cycles in regular 2-connected g

Hamilton cycles in regular 2-connected graphs

✍ J.A Bondy; M Kouider 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Hamilton Cycles in Almost-Regular 2-Conn

Hamilton Cycles in Almost-Regular 2-Connected Graphs

✍ B. Jackson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Hamilton Cycles in 2-Connected Regular B

Hamilton Cycles in 2-Connected Regular Bipartite Graphs

✍ B. Jackson; H. Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 671 KB

Hamilton cycles in regular 3-connected g

Hamilton cycles in regular 3-connected graphs

✍ Yongjin Zhu; Hao Li 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 993 KB

We show in this paper that for k Z-63, every 3-connected, k-regular simple graph on at most yk vertices is hamiltonian.

Hamilton cycles in regular graphs

✍ Bill Jackson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## UNIVERSIW OF WATERLOO ' The research reported here has been sponsored by the Canadian Commonwealth Association.

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