Packing trees into planar graphs
The main problem considered in this paper is the following: given two trees both with n vertices, whether it is possible to draw them on the plane with the same set of vertices without crossings and duplicated edges. We formulate this problem in terms of packing graphs and give a solution in several situations. We also solve some related problems on drawing trees and cycles.
- 1.B. Bollobás, Extremal Graph Theory, in Handbook of Combinatorics, vol. II, R.L. Graham, M. Grötschel and L. Lovász (eds.), pp. 1231–1292, North-Holland (1995).Google Scholar
- 2.S.M. Hedetniemi, S.T. Hedetniemi and P.J. Slater, A note on packing two trees into K n, Ars Combinatoria 11 (1981), 149–153.Google Scholar