1. B. Bollobás and S. E. Eldridge,Packings of graphs and applications to computational complexity, Proc. Fifth British Combinatorics Conference (Aberdeen, 1975), Utilitas Mathematica Publishing, Inc., Winnipeg.
2. D. Burns and S. Schuster,Every (p,p−2) graph is contained in its complement, J. Graph Theory1 (1977), 277–279.
3. N. Sauer and J. Spencer,Edge disjoint placement of graphs, J. Combinatorial Theory, Ser. B, to appear.
4. S. Schuster,Fixed-point-free embeddings of graphs in their complements, to appear.