UNIFORMLY RESOLVABLE (C-4, K-1,K-3)-DESIGNS OF INDEX 2

In this paper we consider the uniformly resolvable decompositions of the complete graph lambda K-v into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We consider the cases in which all the resolution classes are either C-4 or K-1,K-3. We prove that this type of system does not exist for lambda odd and determine completely the spectrum for lambda = 2.