Planar packing of trees and spider trees

DOI10.1016/J.IPL.2008.11.002zbMATH Open1193.05059OpenAlexW2067814301MaRDI QIDQ976102FDOQ976102

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

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

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)

Cites Work

• Packing graphs: The packing problem solved
• Packing trees into planar graphs
• A note on packing paths in planar graphs
• Title not available (Why is that?)
• Packing paths perfectly
• Edge-disjoint placement of three trees
• Some results on packing graphs in their complements

Cited In (5)

• Packing Trees into 1-planar Graphs
• Compatible spanning trees
• 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)