Packing trees into planar graphs

Authors:
A. García;C. Hernando;F. Hurtado;M. Noy;J. Tejel
Affiliations:
Dep. Métodos Estadísticos, Universidad De Zaragoza, Pl. San Francisco S-N 50009 Zaragoza, Spain;Dep. Matemàtica Aplicada I, Universitat Politècnica De Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Dep. Matemàtica Aplicada II, Universitat Politècnica De Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Dep. Matemàtica Aplicada II, Universitat Politècnica De Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain;Dep. Métodos Estadísticos, Universidad De Zaragoza, Pl. San Francisco S-N 50009 Zaragoza, Spain
Venue:
Journal of Graph Theory
Year:
2002

Citing 0
Cited 6

Partitions of complete geometric graphs into plane trees

Computational Geometry: Theory and Applications
Planar packing of trees and spider trees

Information Processing Letters
Partitions of complete geometric graphs into plane trees

Computational Geometry: Theory and Applications
Partitions of complete geometric graphs into plane trees

GD'04 Proceedings of the 12th international conference on Graph Drawing
Packing and squeezing subgraphs into planar graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Planar packing of binary trees

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

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