DOI: 10.1002/jcd.21913 ISSN:
On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
Nevena Francetić, Mateja Šajna- Discrete Mathematics and Combinatorics
Abstract
We examine the necessary and sufficient conditions for a complete symmetric equipartite digraph with parts of size to admit a resolvable decomposition into directed cycles of length . We show that the obvious necessary conditions are sufficient for in each of the following four cases: (i) is even; (ii) ; (iii) and or ; and (iv) , and if , then for a prime .