✦ LIBER ✦

Almost resolvable decompositions of 2Kn into cycles of odd length

✍ Scribed by Katherine Heinrich; C.C Lindner; C.A Rodger

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 706 KB
Volume: 49
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(88)90053-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost resolvable decomposition of Kn∗

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

Decomposition of k∗n into circuits of od

Decomposition of k∗n into circuits of odd length

✍ D. Sotteau 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 849 KB

n 1 his paper we prov that the complete symmetric directed graph with j'~ vertices Ki be dt?ct~mposed into irected circuits of length k, where k is an odd integer, if n = 0 or i (meld k ) and rl b k.

Decomposing complete equipartite graphs

Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd

✍ Benjamin R. Smith 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this article, we introduce a new technique for obtaining cycle decompositions of complete equipartite graphs from cycle decompositions of related multigraphs. We use this technique to prove that if __n__, __m__ and λ are positive integers with __n__ ≥ 3, λ≥ 3 and __n__ and λ both odd

Decomposition of Km,n(Km,n∗) into cycles

Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k

✍ D Sotteau 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Decomposing complete equipartite graphs

Decomposing complete equipartite graphs into cycles of length 2p

✍ Benjamin R. Smith 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

## Abstract It is an open problem to determine whether a complete equipartite graph $K\_m\*{\overline{K}}\_n$ (having __m__ parts of size __n__) admits a decomposition into cycles of arbitrary fixed length $k$ whenever __m__, __n__, and __k__ satisfy the obvious necessary conditions for the existen

Decomposition of the complete graph plus

Decomposition of the complete graph plus a 1-factor into cycles of equal length

✍ Mateja Šajna 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB 👁 1 views

## Abstract We determine the necessary and sufficient conditions for the existence of a decomposition of the complete graph of even order with a 1‐factor added into cycles of equal length. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 170–207, 2003; Published online in Wiley InterScience (www