✦ LIBER ✦

A 1-factorization of the line graphs of complete graphs

✍ Scribed by Brian Alspach

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 254 KB
Volume: 6
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190060408

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Nilpotent 1-factorizations of the comple

Nilpotent 1-factorizations of the complete graph

✍ Gloria Rinaldi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

Abelian 1-Factorizations of the Complete

Abelian 1-Factorizations of the Complete Graph

✍ Marco Buratti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Extending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45-48), we prove that for any Abelian group G of even order, except for G Z 2 n with n > 2, there exists a onefactorization of the complete graph admitting G as a sharply-vertex-transitive automorphism group.

Cube factorizations of complete graphs

✍ Peter Adams; Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≡ 16 (mod 24), thus providing a new family of unifor

An isomorphic factorization of the compl

An isomorphic factorization of the complete graph

✍ F. K. Hwang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

We give necessary and sufficient conditions that the complete graph K, has an isomorphic factorization into Kr X K,. We show that this factorization has an application to clone library screening.

On the size of graphs with complete-fact

On the size of graphs with complete-factors

✍ Jin Akiyama; Peter Frankl 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

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