✦ LIBER ✦

Detecting Hamiltonian cycles

✍ Scribed by Charles N. Friedman

Book ID: 107884573
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 383 KB
Volume: 47
Category: Article
ISSN: 0096-3003
DOI: 10.1016/0096-3003(92)90042-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alternating Hamiltonian cycles

✍ Béla Bollobás; Paul Erdös 📂 Article 📅 1976 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 259 KB

On Hamiltonian cycles and Hamiltonian pa

On Hamiltonian cycles and Hamiltonian paths

✍ M. Sohel Rahman; M. Kaykobad 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 89 KB

On Hamiltonian cycles as optimal p-cycle

On Hamiltonian cycles as optimal p-cycles

✍ Schupke, D.A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 475 KB

A remark on Hamiltonian cycles

✍ Roland Häggkvist; G.G Nicoghossian 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 107 KB

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