✦ LIBER ✦

Cyclic Hamiltonian cycle systems of the complete graph

✍ Scribed by Marco Buratti; Alberto Del Fra

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 251 KB
Volume: 279
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00267-x

No coin nor oath required. For personal study only.

✦ Synopsis

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 above but (k; m) = (3; 3).

📜 SIMILAR VOLUMES

Cyclic even cycle systems of the complet

Cyclic even cycle systems of the complete graph

✍ Shung-Liang Wu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 1 views

## Abstract In this article, it is proved that for each even integer __m__⩾4 and each admissible value __n__ with __n__>2__m__, there exists a cyclic __m__‐cycle system of __K__~__n__~, which almost resolves the existence problem for cyclic __m__‐cycle systems of __K__~__n__~ with __m__ even. © 201

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.

Alternating hamiltonian cycles in two co

Alternating hamiltonian cycles in two colored complete bipartite graphs

✍ A. G. Chetwynd; A. J. W. Hilton 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 2 views

## Abstract We give necessary and sufficient conditions for the existence of an alternating Hamiltonian cycle in a complete bipartite graph whose edge set is colored with two colors.

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

Symmetric Hamilton cycle decompositions

Symmetric Hamilton cycle decompositions of the complete graph

✍ Jin Akiyama; Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views

Cycle decompositions of complete graphs

✍ E.J. Farrell 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 447 KB

The circuit polynomial c%f the complete graph K, is used to deduce results about nodedisjoint -vcle decompositiorls of K,, satisfying variow restrictions.