1. Decomposition of complete graphs into isomorphic subgraphs with five vertices;Bermond;Ars Combin.,1980
2. J.C. Bermond, D. Sotteau, Graph decompositions and G-designs, Proceedings of the Fifth British Combinatorial Conference 1975, Congressus Numerantium XV, Utilitas Math., Winnipeg, 1976, pp. 53–72.
3. D.E. Bryant, Embeddings of partial Steiner triple systems, J. Combin. Theory Ser A 106 (1) (2004) 77–108.
4. Small embeddings for partial G-designs when G is bipartite;Bryant;Bull. Inst. Combin. Appl.,1999
5. A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k),k⩾3, where c(k) is a quadratic function of k;Hoffman;Discrete Math.,2003