Lecture Notes in Computer Science Volume 1353, 1997, pp 383-390

Packing trees into planar graphs

* Final gross prices may vary according to local VAT.

Get Access

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.