Tree-width and large grid minors in planar graphs

A. Grigoriev

Tree-width and large grid minors in planar graphs

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

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

Access to Document

https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1362/3397.html

Cite this

@article{0ff0a7574d0e45a794f5d493e8c242b5,

title = "Tree-width and large grid minors in planar graphs",

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.",

author = "A. Grigoriev",

year = "2011",

month = jan,

day = "1",

language = "English",

volume = "13",

pages = "13--20",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1462-7264",

publisher = "Maison de l'informatique et des mathematiques discretes",

number = "1",

}

TY - JOUR

T1 - Tree-width and large grid minors in planar graphs

AU - Grigoriev, A.

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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.

AB - 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.

M3 - Article

SN - 1462-7264

VL - 13

SP - 13

EP - 20

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

IS - 1

ER -