Tree-width and large grid minors in planar graphs
Alexander Grigoriev · Discrete Mathematics & Theoretical Computer Science · 2011
Graphs and Algorithms We show that for a planar graph with no g-grid minor there exists a tree-decomposition of width at most 5g - 6. The proof is constructive and simple. The underlying algorithm for the tree-decomposition runs in O(n(2) log n) time.