✦ LIBER ✦

Estimates on the size of the cycle spectra of Hamiltonian graphs

✍ Scribed by Bahls, Patrick; Kutler, Lauren; Mousley, Sarah

Book ID: 120652420
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 391 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.04.033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle spectra of Hamiltonian graphs

✍ Kevin G. Milans; Florian Pfender; Dieter Rautenbach; Friedrich Regen; Douglas B. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 152 KB

On the Cycle Spectrum of Cubic Hamiltoni

On the Cycle Spectrum of Cubic Hamiltonian Graphs

✍ Janina Müttel, Dieter Rautenbach, Friedrich Regen, Thomas Sasse 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 169 KB

On the Approximation of Finding A(nother

On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs

✍ Cristina Bazgan; Miklos Santha; Zsolt Tuza 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 144 KB 👁 1 views

It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP-hard in general, and no polynomial-time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the co

On the Hamiltonian cycle and the Hamilto

On the Hamiltonian cycle and the Hamiltonian chain in the Cartesian product of two graphs

✍ K. A. Zaretskii 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 629 KB

Cyclic Hamiltonian cycle systems of the

Cyclic Hamiltonian cycle systems of the complete graph

✍ Marco Buratti; Alberto Del Fra 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 251 KB

We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but k = 15 and p with p prime and ¿ 1. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k; m) of odd integers with k as abo

On hamiltonian cycles in the prism over

On hamiltonian cycles in the prism over the odd graphs

✍ Letícia R. Bueno; Peter Horák 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 2 views

The Kneser graph K (n, k) has as its vertex set all k-subsets of an n-set and two k-subsets are adjacent if they are disjoint. The odd graph O k is a special case of Kneser graph when n = 2k +1. A long standing conjecture claims that O k is hamiltonian for all k>2. We show that the prism over O k is