Uniformly resolvable decompositions of Kv into paths on two, three and four vertices

In this paper we consider uniformly resolvable decompositions of the complete graph Kv, i.e., decompositions of Kv whose blocks can be partitioned into factors and each factor contains pairwise isomorphic blocks. We determine necessary and sufficient conditions for the existence of a uniformly resolvable decomposition of Kv into paths on two, three and four vertices.