Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles (Q1207298)

This paper deals with decompositions of complete digraphs into a spanning set of factors, each of which is a vertex-disjoint union of isomorphic oriented 4-cycles. Necessary and sufficient conditions are given for the existence of such decompositions for three orientations of the 4-cycle (those for the other orientation have already appeared in the literature). The authors also consider decompositions in which each factor spans all but one of the vertices of the complete digraph, and give necessary and sufficient conditions for the three orientations of the 4-cycle for which the problem was unsolved.