论文信息 - Bipartite 2-Factorizations of Complete Multipartite Graphs

Bipartite 2-Factorizations of Complete Multipartite Graphs

It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipartite 2-factor of K, then there exists a factorization of K into F; except that there is no factorization of K6, 6 into F when F is the union of two disjoint 6-cycles.

William Pettersson | Darryn E. Bryant | Peter Danziger

[1] Jiuqiang Liu,et al. The equipartite Oberwolfach problem with uniform tables , 2003, J. Comb. Theory, Ser. A.

[2] Renu C. Laskar,et al. On decomposition of r-partite graphs into edge-disjoint hamilton circuits , 1976, Discret. Math..

[3] Roland Häggkvist,et al. A Lemma on Cycle Decompositions , 1985 .

[4] Jean-Claude Bermond,et al. Hamiltonian decomposition of Cayley graphs of degree 4 , 1989, J. Comb. Theory, Ser. B.

[5] Darryn Bryant,et al. On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors , 2013 .

[6] W. L. Piotrowski,et al. The solution of the bipartite analogue of the Oberwolfach problem , 1991, Discret. Math..

[7] Victor Scharaschkin,et al. Complete solutions to the Oberwolfach problem for an infinite set of orders , 2009, J. Comb. Theory, Ser. B.

[8] Matthew Dean. On Hamilton Cycle Decomposition of 6-regular Circulant Graphs , 2006, Graphs Comb..

[9] Brian Alspach,et al. Research Problems , 1984, Discret. Math..

[10] Darryn E. Bryant,et al. On bipartite 2‐factorizations of kn − I and the Oberwolfach problem , 2011, J. Graph Theory.

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