𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Resolvable decomposition of Kn∗

✍ Scribed by J.C Bermond; A Germa; D Sotteau

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
357 KB
Volume
26
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle Decompositions of Kn and Kn−I
Cycle Decompositions of Kn and Kn−I
✍ Brian Alspach; Heather Gavlas 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 251 KB

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.

EveryH-decomposition ofKnhas a Nearly Re
EveryH-decomposition ofKnhas a Nearly Resolvable Alternative
✍ Noga Alon; Raphael Yuster 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 96 KB

Let H be a fixed graph. An H -decomposition of K n is a coloring of the edges of K n such that every color class forms a copy of H . Each copy is called a member of the decomposition. The resolution number of an H -decomposition L of K n , denoted χ (L), is the minimum number t such that the color c

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