✦ LIBER ✦

Cycle Decompositions of Kn and Kn−I

✍ Scribed by Brian Alspach; Heather Gavlas

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 251 KB
Volume: 81
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1996

No coin nor oath required. For personal study only.

✦ Synopsis

We establish necessary and sufficient conditions for decomposing the complete graph of even order minus a 1-factor into even cycles and the complete graph of odd order into odd cycles.

📜 SIMILAR VOLUMES

Cycle decompositions of the line graph o

Cycle decompositions of the line graph of Kn

✍ M Colby; C.A Rodger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Decomposition de Km+Kn en cycles hamilto

Decomposition de Km+Kn en cycles hamiltoniens

✍ Jacques Aubert; Bernadette Schneider 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 714 KB

Let K,,, be the complete g.'aph of order m. We prove that the Cartesian sum K,, + K, can be decomposed into 4( nt + n -2) hamiltonian cycles if m + n is even and into &m i-II -3) hamiltonian cycles and a perfect matching if m + n i? odd. Soit K, le graphe complet d'ordre tn. Nous dkmontrons que la

Resolvable decomposition of Kn∗

✍ J.C Bermond; A Germa; D Sotteau 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Almost resolvable decomposition of Kn∗

✍ F.E Bennett; D Sotteau 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Almost resolvable decompositions of 2Kn

Almost resolvable decompositions of 2Kn into cycles of odd length

✍ Katherine Heinrich; C.C Lindner; C.A Rodger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 706 KB

On DRC-covering of Kn by cycles

✍ Jean-Claude Bermond; David Coudert; Min-Li Yu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

## Abstract This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF‐networks which are protected independently from each other. The problem can be stated as follows: for a given graph __G__, find a cycle cov