1. B.A. Anderson, A perfectly arranged room square, Proc. 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Math. (1973) 141-150.
2. On decompositions of r-partite graphs into edge — disjoint hamiltonian circuits;Auerbach;Discrete Math.,1976
3. Graphs and Hypergraphs;Berge,1973
4. J.-C. Bermond and V. Faber, in: Problems of the 5th British Combinatorial Conference, Aberdeen 1975, Utilitas Math. Congressus Numerantium XV (1975). 695.
5. Decomposition of the complete directed graph into k-circuits;Bermond;J. Combinatorial Theory,1976