𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of k∗n into circuits of odd length

✍ Scribed by D. Sotteau

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
849 KB
Volume
15
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

Decompositions of highly connected graph
Decompositions of highly connected graphs into paths of length 3
✍ Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

## Abstract We prove that a 171‐edge‐connected graph has an edge‐decomposition into paths of length 3 if and only its size is divisible by 3. It is a long‐standing problem whether 2‐edge‐connectedness is sufficient for planar triangle‐free graphs, and whether 3‐edge‐connectedness suffices for graph

Decompositions of Km,n into cubes
Decompositions of Km,n into cubes
✍ Saad El-Zanati; Charles Vanden Eynden 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

For a complete bipartite graph to be decomposable into isomorphic cubes, certain conditions on the number of cube and bipartition vertices must hold. We prove these necessary conditions sufficient in some cases. For cubes of fixed dimension d (indeed for d-regular bipartite graphs in general) we sho