Planar packing of trees and spider trees

DOI10.1016/j.ipl.2008.11.002zbMath1193.05059OpenAlexW2067814301MaRDI QIDQ976102

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) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Packing Trees into 1-planar Graphs ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Compatible spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Packing paths perfectly
• Packing graphs: The packing problem solved
• A note on packing paths in planar graphs
• Edge-disjoint placement of three trees
• Packing trees into planar graphs

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