참고문헌
- B. Bollobas, Extremal Graph Theory, London Mathematical Society Monographs, 11, Academic Press, Inc., London, 1978.
- S. Brandt, Embedding graphs without short cycles in their complements, in Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 115-121, Wiley-Intersci. Publ, Wiley, New York, 1995.
- R. J. Faudree, C. C. Rousseau, R. H. Schelp, and S. Schuster, Embedding graphs in their complements, Czechoslovak Math. J. 31(106) (1981), no. 1, 53-62. https://doi.org/10.21136/CMJ.1981.101722
- J.-L. Fouquet and A. P. Wojda, Mutual placement of bipartite graphs, Discrete Math. 121 (1993), no. 1-3, 85-92. https://doi.org/10.1016/0012-365X(93)90540-A
- A. Gorlich, M. Polisniak, M.Wozniak, and A. Ziolo, A note on embedding graphs without short cycles, Discrete Math. 286 (2004), no. 1-2, 75-77. https://doi.org/10.1016/j.disc.2003.11.048
- B. Orchel, 2-placement of (p, q)-trees, Discuss. Math. Graph Theory 23 (2003), no. 1, 23-36. https://doi.org/10.7151/dmgt.1183
- N. Sauer and H. Wang, The chromatic number of the two packings of a forest, Math. Yellow Series of University of Calgary (1992), No. 732.
- H. Wang, Packing two forests into a bipartite graph, J. Graph Theory 23 (1996), no. 2, 209-213. https://doi.org/10.1002/(SICI)1097-0118(199610)23:2<209::AID-JGT12>3.0.CO;2-B
- H. Wang, Packing two bipartite graphs into a complete bipartite graph, J. Graph Theory 26 (1997), no. 2, 95-104. https://doi.org/10.1002/(SICI)1097-0118(199710)26:2<95::AID-JGT4>3.0.CO;2-A