✦ LIBER ✦

Hamilton cycles in highly connected and expanding graphs

✍ Scribed by Dan Hefetz; Michael Krivelevich; Tibor Szabó

Book ID: 106167725
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 584 KB
Volume: 29
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-009-2362-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 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 regular 2-connected g

Hamilton cycles in regular 2-connected graphs

✍ Bill Jackson 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 968 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

Hourglasses and Hamilton cycles in 4-con

Hourglasses and Hamilton cycles in 4-connected claw-free graphs

✍ Tomáš Kaiser; MingChu Li; Zdeněk Ryjáček; Liming Xiong 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract We show that if __G__ is a 4‐connected claw‐free graph in which every induced hourglass subgraph __S__ contains two non‐adjacent vertices with a common neighbor outside __S__, then __G__ is hamiltonian. This extends the fact that 4‐connected claw‐free, hourglass‐free graphs are hamilton