Ck-factorization of complete bipartite graphs
暂无分享,去创建一个
In this paper, it is shown that a necessary and sufficient condition for the existence of aCk-factorization ofKm,n is (i)m = n ≡ 0 (mod 2), (ii)k ≡ 0 (mod 2),k ≥ 4 and (iii) 2n ≡ 0 (modk) with precisely one exception, namely m =n = k = 6.
[1] Douglas R. Stinson,et al. On Decomposing Graphs into Isomorphic Uniform 2-Factors , 1985 .
[2] Dominique Sotteau. Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k , 1981, J. Comb. Theory, Ser. B.