[1] J. С. Bermond, D. Sotteau: Graph decompositions and G-designs. Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, 1975). Congressus Numeratium, No. XV, Utilitas Math., Winnipeg, Man., (1976), 53-72. MR 0450102

[2] J. F. Fink: Every graph is an induced isopart of a connected regular graph. submitted.

[3] F. Harary R. W. Robinson, N. С. Wormald: Isomorphic factorizations V.: Directed graphs. Mathematika 25 (1978), 279-285. DOI 10.1112/S0025579300009529 | MR 0533135

[4] A. Rosa: On certain valuations of the vertices of a graph. Theory of Graphs. Proc. Internat. Sympos. Rome 1966, Gordon and Breach, New York, (1967), 349-355. MR 0223271

[5] R. M. Wilson: Decomposition of complete graphs into subgraphs isomorphic to a given graph. Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, 1975). Congressus Numeratium No XV, Utilitas Math., Winnipeg, Man. (1976), 647-659. MR 0396347