Matching divisible designs with block size four

We consider edge-decompositions of the graph join of several equal-sized one-factors into cliques of a prescribed size. These objects are variants of group divisible designs and have applications to packings, coverings, and embeddings. Assuming block (clique) size four, we show that the obvious divisibility and counting conditions are sufficient for the existence of such designs.