[1] M. Behzad, G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston, 1971. MR 0432461 | Zbl 0238.05101

[2] B. Bollobas, S. E. Eldridge: Packings of Graphs and Applications to Computational Complexity. J. of Comb. Theory (B), 25 (1978), 105-124. DOI 10.1016/0095-8956(78)90030-8 | MR 0511983 | Zbl 0387.05020

[3] D. Burns, S. Schuster: Every (p,p - 2) Graph is Contained in its Complement. J. of Graph Theory, 1 (1977), 277-299. MR 0465934 | Zbl 0375.05046

[4] P. A. Catlin: Embedding Subgraphs under Extremal Degree Conditions. Proc. 8th S-E Conf. Combinatorics, Graph Theory, and Computing, (1977), 139-145. MR 0485533 | Zbl 0434.05045

[5] P. A. Catlin: Subgraphs of Graph, I. Discrete Math., 10 (1974), 225-233. DOI 10.1016/0012-365X(74)90119-8 | MR 0357230

[6] F. Harary: Graph Theory. Addison-Wesley, Reading, Mass., 1969. MR 0256911 | Zbl 0196.27202

[7] N. Sauer, J. Spencer: Edge Disjoint Placement of Graphs. J. of Comb. Theory (B), 25 (1978), 295-302. DOI 10.1016/0095-8956(78)90005-9 | MR 0516262 | Zbl 0417.05037

[8] S. Schuster: Embedding (p, p - 1) Graphs Their Complements. Israel J. of Math., 30 (1978), 313-320. DOI 10.1007/BF02761996 | MR 0498199