Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 13-20 |
| Number of pages | 8 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Volume | 13 |
| Issue number | 1 |
| Publication status | Published - 1 Jan 2011 |