Packing and Squeezing Subgraphs into Planar Graphs

DOI10.1007/978-3-540-74456-6_36MaRDI QIDQ3525587zbMATH OpenOpenAlexFDO

Authors Fabrizio Frati, Markus Geyer, Michael Kaufmann

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74456-6_36

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• The planar tree packing theorem
• The planar tree packing theorem
• Packing trees into planar graphs
• Packing trees into 1-planar graphs
• Planar packing of trees and spider trees

Cited in

(6)

• Packing smaller graphs into a graph
• Planar packing of binary trees
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
• Packing trees into 1-planar graphs
• Packing trees into 1-planar graphs
• Planar packing of trees and spider trees

This page was built for publication: Packing and Squeezing Subgraphs into Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525587)