𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing indecomposable 1-factorizations of the complete multigraph

✍ Scribed by Dan Archdeacon; Jeffrey H. Dinitz

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
762 KB
Volume
92
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Archdeacon, D. and J.H. Dinitz. Constructing indecomposable I-factorizations of the complete multigraph, Discrete Mathematics 92 (1991) 9-19.

πŸ“œ SIMILAR VOLUMES

Indecomposable factorizations of multigr
Indecomposable factorizations of multigraphs
✍ A.H. Baartmans; W.D. Wallis πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 592 KB

A one-factorization of a complete multigraph is called decomposable if some proper subset of the factors also forms a one-factorization of a complete multigraph; otherwise it is indecomposable. Some results on the existence of indecomposable one-factor&ions will be proven.

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.