Geodesic
On the directed Oberwolfach problem with equal cycle lengths
Andrea Burgess1 ; Mateja Šajna2
1Ryerson University
2University of Ottawa
The electronic journal of combinatorics, Tome 21 (2014) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We examine the necessary and sufficient conditions for a complete symmetric digraph $K_n^\ast$ 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$.
DOI : 10.37236/2982
Classification : 05C20, 05C12, 05B30, 05C38, 05C51, 05C70
Mots-clés : directed Oberwolfach problem, complete symmetric digraph, resolvable directed cycle decomposition, Mendelsohn design

Andrea Burgess  1   ; Mateja Šajna  2

1 Ryerson University
2 University of Ottawa 
@article{10_37236_2982,
     author = {Andrea Burgess and Mateja \v{S}ajna},
     title = {On the directed {Oberwolfach} problem with equal cycle lengths},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {1},
     doi = {10.37236/2982},
     zbl = {1300.05114},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2982/}
}
TY  - JOUR
AU  - Andrea Burgess
AU  - Mateja Šajna
TI  - On the directed Oberwolfach problem with equal cycle lengths
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2982/
DO  - 10.37236/2982
ID  - 10_37236_2982
ER  - 
%0 Journal Article
%A Andrea Burgess
%A Mateja Šajna
%T On the directed Oberwolfach problem with equal cycle lengths
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2982/
%R 10.37236/2982
%F 10_37236_2982
Andrea Burgess; Mateja Šajna. On the directed Oberwolfach problem with equal cycle lengths. The electronic journal of combinatorics, Tome 21 (2014) no. 1. doi: 10.37236/2982

Cité par Sources :