We examine the necessary and sufficient conditions for a complete symmetric digraph K*n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Burgess, A., & Šajna, M. (2014). On the directed Oberwolfach Problem with equal cycle lengths. Electronic Journal of Combinatorics, 21(1). https://doi.org/10.37236/2982