𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposing the complete graph into cycles of many lengths

✍ Scribed by Darryn E. Bryant; Peter Adams

Publisher
Springer Japan
Year
1995
Tongue
English
Weight
346 KB
Volume
11
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

Decomposing complete equipartite graphs
Decomposing complete equipartite graphs into short even cycles
✍ Benjamin R. Smith; Nicholas J. Cavenagh πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 145 KB

In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.

Decomposing complete multipartite graphs
Decomposing complete multipartite graphs into closed trails of arbitrary even lengths
✍ Benjamin R. Smith; Selda KüçükΓ§ifΓ§i; Emineşule YazΔ±cΔ± πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 1 views

We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths.