✦ LIBER ✦

Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph

✍ Scribed by Marco Buratti; Francesca Merola

Book ID: 112120488
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 660 KB
Volume: 21
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.21311

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique partitions of the cocktail party

Clique partitions of the cocktail party graph

✍ D.A Gregory; S McGuinness; W Wallis 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Let To denote the complement of a perfect matching in the complete graph on v vertices, v even, and let cp(To) be the minimum number of cliques needed to partition the edge-set of To. We prove that cp(To)>-v for v 1> 8 and give a design characterization of the cases where equality holds. We also sho

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

Complexity of the hamiltonian cycle in r

Complexity of the hamiltonian cycle in regular graph problem

✍ C. Picouleau 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 491 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

The construction of optimal Hamiltonian

The construction of optimal Hamiltonian cycles in multivertex graphs

✍ Zh. N. Zaitseva; M. E. Shtein 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 294 KB

Cycle systems of the line graph of the c

Cycle systems of the line graph of the complete graph

✍ Cox, B.A.; Rodger, C.A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

For all m = 0 (mod 41, for all n = 0 or 2 (mod m), and for all n = 1 (mod 2m) w e find an m-cycle decomposition of the line graph of the complete graph K,. In particular, this solves the existence problem when m is a power of two.