The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order

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.

• Type: Journal
• Year: 2002
• Where: COMBINATORICS
• Authors: Brett Stevens
• Keywords: Anti-Oberwolfach Problem, COMBINATORICS 2002, Consistent Cycle Components, Directed Anti-Oberwolfach Problem