Let L = fH1;H2; : : : ;Hrg be a family of subgraphs of a graph G.An L-decomposition of G is an edge-disjoint decomposition of G intopositive integer i copies of Hi, where i 2 f1; 2; : : : ; rg. Let Ck, Pkand Sk denote a cycle, a path and a star with k edges, respectively.In this paper, we prove that a balanced complete bipartite graph with2n vertices has a fCk; Pk; Skg-decomposition if and only if k is even,4 k n and n2 0 (mod k).
展开▼
