Affiliation:
1. Department of Mathematics and Statistics University of Ottawa Ottawa Ontario Canada
Abstract
AbstractWe 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 .
Subject
Discrete Mathematics and Combinatorics
Reference24 articles.
1. P.Adams D.Bryant Resolvable directed cycle systems of all indices for cycle length 3 and 4 unpublished.
2. Two‐factorisations of complete graphs of orders fifteen and seventeen;Adams P.;Australas. J. Combin,2006
3. Some observations on the oberwolfach problem
4. The Oberwolfach problem and factors of uniform odd length cycles
5. Resolvable Mendelsohn designs with block size 4
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献