The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle components in each 2-factor like the Oberwolfach problem, but such that every admissible cycle size appears at least once in some 2-factor. The solution takes advantage of both Piotrowski's decomposition techniques used to solve Oberwolfach problems and the techniques used by the author to solve the undirected anti-Oberwolfach problem.

Additional Metadata
Journal Electronic Journal of Combinatorics
Citation
Stevens, B. (2002). The directed anti-oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order. Electronic Journal of Combinatorics, 9(1 R), 1–15.