Planar packing of trees and spider trees

DOI10.1016/J.IPL.2008.11.002MaRDI QIDQ976102zbMATH OpenOpenAlexFDO

Authors Fabrizio Frati, Markus Geyer, Michael Kaufmann

Publication date 16 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.11.002

zbMATH Keywords

graph algorithmsgraph packing

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The planar tree packing theorem
• The planar tree packing theorem
• Packing trees into planar graphs
• Packing and Squeezing Subgraphs into Planar Graphs
• Planar packing of binary trees

Cites work

• scientific article; zbMATH DE number 3771651 (Why is no real title available?)
• A note on packing paths in planar graphs
• Edge-disjoint placement of three trees
• Packing graphs: The packing problem solved
• Packing paths perfectly
• Packing trees into planar graphs
• Some results on packing graphs in their complements

Cited in

(7)

• Compatible spanning trees
• Packing trees into 1-planar graphs
• The planar tree packing theorem
• The planar tree packing theorem
• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Packing and Squeezing Subgraphs into Planar Graphs
• The Mathematics of Ferran Hurtado: A Brief Survey

This page was built for publication: Planar packing of trees and spider trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976102)