Indecomposable factorizations of multigraphs

AbstractA 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-factorizations will be proven