Planar packing of trees and spider trees

Authors:
Fabrizio Frati;Markus Geyer;Michael Kaufmann
Affiliations:
Dipartimento di Informatica e Automazione, Università Roma Tre, Italy;Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Germany;Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Germany
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 2

Packing paths perfectly

Discrete Mathematics
A note on packing paths in planar graphs

Mathematical Programming: Series A and B
Edge-disjoint placement of three trees

European Journal of Combinatorics
Packing trees into planar graphs

Journal of Graph Theory

Planar packing of binary trees

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

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

In [A. Garcia, C. Hernando, F. Hurtado, M. Noy, J. Tejel, Packing trees into planar graphs, J. Graph Theory (2002) 172-181] Garcia et al. conjectured that for every two non-star trees there exists a planar graph containing them as edge-disjoint subgraphs. In this paper we prove the conjecture in the case in which one of the trees is a spider tree.