Packing trees into planar graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Planar packing of trees and spider trees
- Packing trees into 1-planar graphs
- Planar packing of cycles and unicyclic graphs
- The planar tree packing theorem
- The planar tree packing theorem
- Packing three copies of a tree into its sixth power
- Packing trees in complete graphs
- Planar packing of binary trees
- Partitions of complete bipartite geometric graphs into plane perfect matchings
- Covering the edges of a complete geometric graph with convex polygons
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- Partitions of complete geometric graphs into plane trees
- Maximum 0-1 timed matching on temporal graphs
- Packing and Squeezing Subgraphs into Planar Graphs
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
- Augmenting the connectivity of outerplanar graphs
- On asymptotic packing of geometric graphs
- The Mathematics of Ferran Hurtado: A Brief Survey
This page was built for publication: Packing trees into planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150194)