𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Oberwolfach problem for complete multigraphs

✍ Scribed by Pavol Gvozdjak

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
368 KB
Volume
173
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we solve a uniform length cycle version of the Oberwolfach problem for multigraphs by giving necessary and sufficient conditions for the existence of a 2-factorization of β€’ ~gdm or )~gdm --I into 2-factors consisting of m cycles only.

πŸ“œ SIMILAR VOLUMES

Some observations on the oberwolfach pro
Some observations on the oberwolfach problem
✍ Brian Alspach; Roland HΓ€ggkvist πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 425 KB

Some results concerning decompositions of Kn, K,, -F (where F denotes a I-factor) and complements of a family of special cubic graphs into 2factors of the same type are given. In particular, if 2d is a divisor of n, it is shown that K, -F can be decomposed into 2-factors each of whose components is

Some results on the Oberwolfach problem
Some results on the Oberwolfach problem
✍ Pavol Hell; Anton Kotzig; Alexander Rosa πŸ“‚ Article πŸ“… 1975 πŸ› Springer 🌐 English βš– 209 KB
Some results on the Oberwolfach problem
Some results on the Oberwolfach problem
✍ Pavol Hell; Anton Kotzig; Alexander Rosa πŸ“‚ Article πŸ“… 1974 πŸ› Springer 🌐 English βš– 52 KB
1-rotational k-factorizations of the com
1-rotational k-factorizations of the complete graph and new solutions to the Oberwolfach problem
✍ Marco Buratti; Gloria Rinaldi πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 149 KB πŸ‘ 1 views

## Abstract We consider __k__‐factorizations of the complete graph that are 1‐__rotational__ under an assigned group __G__, namely that admit __G__ as an automorphism group acting sharply transitively on all but one vertex. After proving that the __k__‐factors of such a factorization are pairwise i