Cycle decompositions of crowns
暂无分享,去创建一个
Abstract For an integer n⩾3, the crown Sn0 is defined to be the graph with vertex set {x0,x1,…,xn−1,y0,y1,…,yn−1} and edge set {x i y j : 0⩽i,j⩽n−1, i≠j} . In this paper we give some sufficient conditions for the edge decomposition of the crown into isomorphic cycles.
[1] Chiang Lin,et al. Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed Graphs , 1995, Combinatorics and Computer Science.
[2] Dominique Sotteau. Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k , 1981, J. Comb. Theory, Ser. B.