Uniformly resolvable decompositions of Kv-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 Γ of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decompositionof a graph G is an edge decomposition of G into X-factors for some graph X ∈ Γ. In this article we completely solve the existence problem for decompositions of K_v-I into Cn-factors and K_1,n-factors in the case when n is even.