Uniformly resolvable decompositions of Kv in 1-factors and 4-stars

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. A uniformly resolvable {X, Y}-decomposition of the complete graph K-v is an edge decomposition of K-v into exactly r X-factors and s Y-factors. In this article we determine necessary and sufficient conditions for when the complete graph K-v has a uniformly resolvable decompositions into 1-factors and K-1,K-4-factors.