On the Tree-Width of Planar Graphs
From MaRDI portal
Publication:2851524
DOI10.1016/j.endm.2009.07.099zbMath1273.05038MaRDI QIDQ2851524
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.099
05C05: Trees
05C10: Planar graphs; geometric and topological aspects of graph theory
05C12: Distance in graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Monadic second-order evaluations on tree-decomposable graphs
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Call routing and the ratcatcher
- Tree-decompositions with bags of small diameter
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Complexity of Finding Embeddings in a k-Tree