✦ LIBER ✦

Hamiltonian Cycles in Graphs

✍ Scribed by ZHENHONG LIU; YONGJIN ZHU; FENG TIAN

Book ID: 119862787
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 390 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16419.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles in Dirac graphs

✍ Bill Cuckler; Jeff Kahn 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 606 KB

Small cycles in Hamiltonian graphs

✍ Uwe Schelten; Ingo Schiermeyer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 733 KB

We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).

Hamiltonian cycles in bipartite graphs

✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 389 KB

Hamiltonian Cycles in T-Graphs

✍ Reay, J. R.; Zamfirescu, T. 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 66 KB

Hamiltonian cycles in I–graphs

✍ Bonvicini, Simona; Pisanski, Tomaž 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Hamiltonian cycles in random regular gra

Hamiltonian cycles in random regular graphs

✍ T.I Fenner; A.M Frieze 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 484 KB