The planar tree packing theorem
From MaRDI portal
(Redirected from Publication:5745398)
The planar tree packing theorem (scientific article; zbMATH DE number 6881132)
The planar tree packing theorem (scientific article; zbMATH DE number 6881132)
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) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(16)- On the tree packing problem
- Labeled 2-packings of trees
- An approximate version of the tree packing conjecture
- Planar packing of binary trees
- The planar tree packing theorem
- Packing trees into planar graphs
- Planar packing of cycles and unicyclic graphs
- Packing and Squeezing Subgraphs into Planar Graphs
- Packing trees into 1-planar graphs
- Non-preemptive tree packing
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- The Treewidth and Pathwidth of Graph Unions
- Three edge-disjoint plane spanning paths in a point set
- Three edge-disjoint plane spanning paths in a point set
- Packing trees into 1-planar graphs
- Planar packing of trees and spider trees
This page was built for publication: The planar tree packing theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745398)