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(n2 log n) time. © 2011 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.
Author supplied keywords
Cite
CITATION STYLE
APA
Grigoriev, A. (2011). Tree-width and large grid minors in planar graphs. Discrete Mathematics and Theoretical Computer Science, 13(1), 13–20. https://doi.org/10.46298/dmtcs.539
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free