✦ LIBER ✦

Factorizations of the Complete Graph intoC5-Factors and 1-Factors

✍ Scribed by Peter Adams; Darryn Bryant; Saad I. El-Zanati; Heather Gavlas

Publisher: Springer Japan
Year: 2003
Tongue: English
Weight: 347 KB
Volume: 19
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-002-0509-5

No coin nor oath required. For personal study only.

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

Sharply transitive 1-factorizations of t

Sharply transitive 1-factorizations of the complete graph with an invariant 1-factor

✍ Gábor Korchmáros 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 682 KB

## Abstract We give some simple characterizations of those __n__ for which __K~n~__ has a sharply transitive 1‐factorization with an assigned automorphism group that acts sharply transitively on the vertex set and also fixes a 1‐factor. © 1994 John Wiley & Sons, Inc.

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

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.

On 4-semiregular 1-factorizations of com

On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs

✍ Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 304 KB