✦ LIBER ✦

Cycle decompositions III: Complete graphs and fixed length cycles

✍ Scribed by Mateja Šajna

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 534 KB
Volume: 10
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.1027

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We show that the necessary conditions for the decomposition of the complete graph of odd order into cycles of a fixed even length and for the decomposition of the complete graph of even order minus a 1‐factor into cycles of a fixed odd length are also sufficient. © 2002 John Wiley & Sons, Inc. J Combin Designs 10: 27–78, 2002

📜 SIMILAR VOLUMES

Cycle decompositions of complete graphs

✍ E.J. Farrell 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 447 KB

The circuit polynomial c%f the complete graph K, is used to deduce results about nodedisjoint -vcle decompositiorls of K,, satisfying variow restrictions.

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

Symmetric Hamilton cycle decompositions

Symmetric Hamilton cycle decompositions of the complete graph

✍ Jin Akiyama; Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views

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

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

Maximum packings of the complete graph w

Maximum packings of the complete graph with uniform length cycles

✍ Daniel Horsley 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≤ m ≤ n.