Packing trees into planar graphs

  • A. García
  • C. Hernando
  • F. Hurtado
  • M. Noy
  • J. Tejel
Packing, Compressing, and Touching
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)

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.

References

  1. 1.
    B. Bollobás, Extremal Graph Theory, in Handbook of Combinatorics, vol. II, R.L. Graham, M. Grötschel and L. Lovász (eds.), pp. 1231–1292, North-Holland (1995).Google Scholar
  2. 2.
    S.M. Hedetniemi, S.T. Hedetniemi and P.J. Slater, A note on packing two trees into K n, Ars Combinatoria 11 (1981), 149–153.Google Scholar
  3. 3.
    M. Maheo, J.F. Saclé y M. Woźniak, Edge-disjoint placement of three trees, European J. of Combinatorics 17 (1996), 543–563.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • A. García
    • 1
  • C. Hernando
    • 2
  • F. Hurtado
    • 3
  • M. Noy
    • 3
  • J. Tejel
    • 1
  1. 1.Dep. Métodos EstadísticosUniversidad de ZaragozaZaragozaSpain
  2. 2.Dep. Matemàtica Aplicada IUniversitat Politècnica de CatalunyaBarcelonaSpain
  3. 3.Dep. Matemàtica Aplicada IIUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations