Packing trees into planar graphs

DOI10.1002/jgt.10042zbMath1007.05042OpenAlexW2528017305MaRDI QIDQ3150194

Ferran Hurtado, Marc Noy, Alfredo Daniel Garcia, F. Javier Tejel, Carmen Hernando

Publication date: 18 March 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10042

zbMATH Keywords

planar graphstreessubgraphspacking graphs

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)

Related Items

Augmenting the connectivity of outerplanar graphs, Maximum 0-1 timed matching on temporal graphs, On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids, Packing Trees into 1-planar Graphs, k-Planar Placement and Packing of Δ-Regular Caterpillars, The Mathematics of Ferran Hurtado: A Brief Survey, Partitions of complete geometric graphs into plane trees, Planar packing of trees and spider trees, PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS

Cites Work

• Edge-disjoint placement of three trees
• The bandwidth problem for graphs and matrices—a survey
• Unnamed Item