Aigner, M. and Brandt, S. (1993) Embedding arbitrary graphs of maximum degree two. J. London Math. Soc. (2) 48 39–51.
 Bollobás, B. and Eldridge, S. E. (1978) Packings of graphs and applications to computational complexity. J. Combin. Theory Ser. B 25 105–124.
 Bollobás, B., Janson, S. and Scott, A. (2017) Packing random graphs and hypergraphs. Random Struct. Alg. 51 3–13.
 Bollobás, B., Kostochka, A. and Nakprasit, K. (2005) On two conjectures on packing of graphs. Combin. Probab. Comput. 14 723–736.
 Bollobás, B., Kostochka, A. and Nakprasit, K. (2008) Packing d-degenerate graphs. J. Combin. Theory Ser. B 98 85–94.
 Catlin, P. A. (1974) Subgraphs of graphs I. Discrete Math. 10 225–233.
 Catlin, P. A. (1976) Embedding subgraphs and coloring graphs under extremal degree conditions. PhD thesis, The Ohio State University. ProQuest LLC, Ann Arbor, MI.
 Corrádi, K. (1969) Problem at Schweitzer competition. Mat. Lapok 20 159–162.
 Csaba, B. (2007) On the Bollobás–Eldridge conjecture for bipartite graphs. Combin. Probab. Comput. 16 661–691.
 Csaba, B., Shokoufandeh, A. and Szemerédi, E. (2003) Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three. Combinatorica 23 35–72.
 Eaton, N. (2000) A near packing of two graphs. J. Combin. Theory Ser. B 80 98–103.
 Hajnal, A. and Szemerédi, E. (1970) Proof of a conjecture of P. Erdős. In Combinatorial Theory and its Applications II: (Proc. Colloq., Balatonfüred, 1969), North-Holland, pp. 601–623.
 Johansson, A. (1996) Asymptotic choice number for triangle-free graphs. Technical report 91-5, DIMACS.
 Kaul, H. and Kostochka, A. (2007) Extremal graphs for a graph packing theorem of Sauer and Spencer. Combin. Probab. Comput. 16 409–416.
 Kaul, H., Kostochka, A. and Yu, G. (2008) On a graph packing conjecture by Bollobás, Eldridge and Catlin. Combinatorica 28 469–485.
 Molloy, M. and Reed, B. (2002) Graph Colouring and the Probabilistic Method, Vol. 23 of Algorithms and Combinatorics, Springer.
 Sauer, N. and Spencer, J. (1978) Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25 295–302.