𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding large cycles in Hamiltonian graphs

✍ Scribed by Tomás Feder; Rajeev Motwani

Book ID
108112859
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
389 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Small cycles in Hamiltonian graphs
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).