𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Mateja Šajna

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
354 KB
Volume
11
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

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.interscience.wiley.com). DOI 10.1002/jcd.10019

📜 SIMILAR VOLUMES

Symmetric Hamilton cycle decompositions
Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
✍ Richard A. Brualdi; Michael W. Schroeder 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB 👁 1 views

Let n ≥ 2 be an integer. The complete graph K n with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that K n -F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n ≡ 2,4 mod 8. We also show that

A 1-factorization of the line graphs of
A 1-factorization of the line graphs of complete graphs
✍ Brian Alspach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.