✦ LIBER ✦

Decomposing complete equipartite graphs into short even cycles

✍ Scribed by Benjamin R. Smith; Nicholas J. Cavenagh

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 145 KB
Volume: 19
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20265

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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 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.

Cyclic even cycle systems of the complet

Cyclic even cycle systems of the complete graph

✍ Shung-Liang Wu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 1 views

## Abstract In this article, it is proved that for each even integer __m__⩾4 and each admissible value __n__ with __n__>2__m__, there exists a cyclic __m__‐cycle system of __K__~__n__~, which almost resolves the existence problem for cyclic __m__‐cycle systems of __K__~__n__~ with __m__ even. © 201

Decompositions of complete graphs into t

Decompositions of complete graphs into triangles and Hamilton cycles

✍ Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 1 views

## Abstract For all odd integers __n__ ≥ 1, let __G~n~__ denote the complete graph of order __n__, and for all even integers __n__ ≥ 2 let __G~n~__ denote the complete graph of order __n__ with the edges of a 1‐factor removed. It is shown that for all non‐negative integers __h__ and __t__ and all p

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