Uniformly Resolvable Decompositions of K_v-I into n-Cycles and n-Stars, for Even n

If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. Given a set Gamma of pairwise non-isomorphic graphs, a uniformly resolvable Gamma-decomposition of a graph G is an edge decomposition of G into X-factors for some graph X is an element of Gamma. In this article we completely solve the existence problem for decompositions of K-v-I into C-n-factors and K-1,K-n-factors in the case when n is even.