Uniformly resolvable decompositions of into and graphs

In this paper we consider the uniformly resolvable decompositions of the complete graph K v , or the complete graph minus a 1-factor as appropriate, into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes consist of either P 3 s or K 3 s.