|
|||||
|
|
Packing trees into planar graphs |
|
| Authors: | A. Garcí a,C. Hernando,F. Hurtado,M. Noy,J. Tejel |
| Abstract: | In this study, we provide methods for drawing a tree with n vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 172–181, 2002 |
| Keywords: | packing tight packing planar graph graph drawing |