Tree-width and large grid minors in planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

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.

Domains

Discrete Mathematics [cs.DM]
Fichier principal
Vignette du fichier
1362-5881-1-PB.pdf (254.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Service Ist Inria Sophia Antipolis-Méditerranée / I3s  : Connect in order to contact the contributor

https://inria.hal.science/hal-00990485

Submitted on : Tuesday, May 13, 2014-3:39:13 PM

Last modification on : Friday, November 24, 2023-11:24:03 AM

Long-term archiving on: Monday, April 10, 2017-10:23:45 PM

Download

Dates and versions

hal-00990485 , version 1 (13-05-2014)

Identifiers

Cite

Alexander Grigoriev. Tree-width and large grid minors in planar graphs. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 1 (1), pp.13--20. ⟨10.46298/dmtcs.539⟩. ⟨hal-00990485⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

TDS-MACS
33 View
2013 Download

Altmetric

Share

Gmail Facebook X LinkedIn More