Abstract
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.
Chapter PDF
Similar content being viewed by others
References
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).
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.
M. Maheo, J.F. Saclé y M. Woźniak, Edge-disjoint placement of three trees, European J. of Combinatorics 17 (1996), 543–563.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
García, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J. (1997). Packing trees into planar graphs. In: DiBattista, G. (eds) Graph Drawing. GD 1997. Lecture Notes in Computer Science, vol 1353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63938-1_83
Download citation
DOI: https://doi.org/10.1007/3-540-63938-1_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63938-1
Online ISBN: 978-3-540-69674-2
eBook Packages: Springer Book Archive