On the Tree-Width of Planar Graphs

DOI10.1016/j.endm.2009.07.099zbMath1273.05038OpenAlexW2069569594MaRDI QIDQ2851524

Youssou Dieng, Cyril Gavoille

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

zbMATH Keywords

planar graphstree-widthtree-decompositiontree-length

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (2)

Treelength of series-parallel graphs ⋮ To Approximate Treewidth, Use Treelength!

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

This page was built for publication: On the Tree-Width of Planar Graphs