On the Oberwolfach problem for complete multigraphs

Abstract 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 λK dm or λK dm − I into 2-factors consisting of m cycles only.

[1]  Anton Kotzig,et al.  On a variation of the Oberwolfach problem , 1979, Discret. Math..

[2]  Z. Baranyai,et al.  Hamiltonian decomposition of lexicographic product , 1981, J. Comb. Theory, Ser. B.

[3]  Haim Hanani,et al.  On Resolvable Balanced Incomplete Block Designs , 1974, J. Comb. Theory, Ser. A.

[4]  Brian Alspach,et al.  Some observations on the oberwolfach problem , 1985, J. Graph Theory.

[5]  Dean G. Hoffman,et al.  The existence of Ck-factorizations of K2n-F , 1991, Discret. Math..

[6]  Douglas R. Stinson,et al.  The Oberwolfach problem and factors of uniform odd length cycles , 1989, J. Comb. Theory, Ser. A.