1. On decomposition of r-partite graphs into edge-disjoint hamiltonian circuits;Auerbach;Discrete Math.,1976
2. Graphs and Hypergraphs;Berge,1973
3. G. Chaty and M. Chein, Path-numbers of k-graphs and symmetric digraphs, Proc. 7th Southeastern Conference on Graph Theory, Computing and Combinatory (1976) 203–216.
4. Covering and packing in graphs I;Harary;Ann. N.Y. Acad. Sci.,1970
5. On covering of graphs;Lovasz,1968