1. Packing and covering the complete graph with cubes;Adams;Australas. J. Combin.,1999
2. Decomposition of complete graphs into isomorphic subgraphs with five vertices;Bermond;Ars Combin.,1980
3. Balanced cycle and circuit designs;Bermond;Ars Combin.,1978
4. G-decomposition of Kn, where G has four vertices or less;Bermond;Discrete Math.,1977
5. Minimal coverings of pairs by triples;Fort;Pacific J. Math.,1958