1. Quasi-complete Latin squares: construction and randomization;Bailey;J. Roy. Statist. Soc. Ser. B,1984
2. Decomposition of the complete directed graph into k-circuits;Bermond;J. Combin. Theory Ser. B,1976
3. Balanced cycle and circuit designs: even cases;Bermond;Ars Combin.,1978
4. Graph decompositions and G-designs;Bermond;Proc. 5th British Combin. Conf. Congr. Numer.,1975
5. Mendelsohn designs admitting the affine group;Brand;Graphs Combin.,1987