✦ LIBER ✦

Cycle spectra of Hamiltonian graphs

✍ Scribed by Kevin G. Milans; Florian Pfender; Dieter Rautenbach; Friedrich Regen; Douglas B. West

Book ID: 116630520
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 152 KB
Volume: 102
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2012.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimates on the size of the cycle spect

Estimates on the size of the cycle spectra of Hamiltonian graphs

✍ Bahls, Patrick; Kutler, Lauren; Mousley, Sarah 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Hamiltonian Cycles in Graphs

✍ ZHENHONG LIU; YONGJIN ZHU; FENG TIAN 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB

Cycle Extendability of Hamiltonian Inter

Cycle Extendability of Hamiltonian Interval Graphs

✍ Chen, Guantao; Faudree, Ralph J.; Gould, Ronald J.; Jacobson, Michael S. 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 137 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).

Polyhedral graphs without hamiltonian cy

Polyhedral graphs without hamiltonian cycles

✍ Hansjoachim Walther 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 309 KB

There is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian graphs having only 5-gons and 8-gons as faces.