Premium
Packing trees into planar graphs
Author(s) -
García A.,
Hernando C.,
Hurtado F.,
Noy M.,
Tejel J.
Publication year - 2002
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10042
Subject(s) - combinatorics , mathematics , planar graph , polygon (computer graphics) , regular polygon , convex polygon , planar , outerplanar graph , graph , discrete mathematics , pathwidth , computer science , geometry , line graph , telecommunications , computer graphics (images) , frame (networking)
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom