1. Resolvable and near-resolvable designs;Abel,2007
2. On the Hamilton-Waterloo problem;Adams;Graph. Combinator.,2002
3. The Oberwolfach problem and factors of uniform length;Alspach;J. Combin. Theory Ser. A,1989
4. Existence of resolvable path designs;Bermond;European J. Combin.,1990
5. S. Bonvicini, M. Buratti, Sharply vertex transitive 2-factorizations of Cayley graphs, preprint.