✦ LIBER ✦

Hamilton cycles in regular 3-connected graphs

✍ Scribed by Yongjin Zhu; Hao Li

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 993 KB
Volume: 110
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90712-o

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

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

Dominating cycles in regular 3-connected

Dominating cycles in regular 3-connected graphs

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

Jackson, B., H. Li and Y. Zhu, Dominating cycles in regular 3-connected graphs, Discrete Mathematics 102 (1992) 163-176. Let G be a 3-connected, k-regular graph on at most 4k vertices. We show that, for k > 63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamilton

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

Generating and Counting Hamilton Cycles

Generating and Counting Hamilton Cycles in Random Regular Graphs

✍ Alan Frieze; Mark Jerrum; Michael Molloy; Robert Robinson; Nicholas Wormald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Let G be chosen uniformly at random from the set G G r, n of r-regular graphs w x Ž . with vertex set n . We describe polynomial time algorithms that whp i find a Ž . Hamilton cycle in G, and ii approximately count the number of Hamilton cycles in G.