𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian cycles in I–graphs

✍ Scribed by Bonvicini, Simona; Pisanski, Tomaž

Book ID
122787025
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
159 KB
Volume
40
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian Cycles in Graphs
Hamiltonian Cycles in Graphs
✍ ZHENHONG LIU; YONGJIN ZHU; FENG TIAN 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB
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).