[1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Graphs & Digraphs. Wadsworth International, Belmont, CA, 1979. MR 0525578 | Zbl 0403.05027

[2] FINK J. F.: Every graph is an induced isopart of a connected regular graph. Submitted for publication.

[3] FINK J. F.: On smallest regular graphs with a given isopart. Submitted for publication. Zbl 0607.05039

[4] FINK J. F., RUIZ S.: Every graph is an induced isopart of a circulant. Submitted for publication. Zbl 0614.05052

[5] KÖNIG D.: Über Graphen und ihre Anwendung auf Determinantentheorie and Mengenlehre. Math. Ann. 77, 1916, 453-465. MR 1511872

[6] PETERSEN J.: Die Theorie der regularen Graphen. Acta Math. 15, 1891, 193-220. MR 1554815

[7] REISS M.: Über eine Steinersche kombinatorische Aufgabe. J. reine u. ang. Mathematik 56,1859, 326-344.

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