The following pages link to Packing trees into planar graphs (Q3150194):
Displaying 16 items.
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- Planar packing of trees and spider trees (Q976102) (← links)
- Packing trees in complete graphs (Q1101132) (← links)
- On asymptotic packing of geometric graphs (Q2081476) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- Partitions of complete geometric graphs into plane trees (Q2489020) (← links)
- Planar Packing of Binary Trees (Q2842173) (← links)
- The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
- The Planar Tree Packing Theorem (Q3132875) (← links)
- Packing Trees into 1-planar Graphs (Q5084698) (← links)
- PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS (Q5237541) (← links)
- The planar tree packing theorem (Q5745398) (← links)
- k-Planar Placement and Packing of Δ-Regular Caterpillars (Q6066468) (← links)
- Covering the edges of a complete geometric graph with convex polygons (Q6624187) (← links)