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.
Cite
CITATION STYLE
García, A., Hernando, C., Hurtado, F., Noy, M., & Tejel, J. (1997). Packing trees into planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 383–390). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_83
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
