Abstract
We give a more simple than in [8] proof of the fact that if a finite graph has no minors isomorphic to the planar grid of the size of r × r, then the tree-width of this graph is less than exp(poly(r)). In the case of planar graphs we prove a linear upper bound which improves the quadratic estimate from [5].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for bran-chwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 627–637. Springer, Heidelberg (1997)
Diestel, R., Jensen, T.R., Gorbunov, K.Y., Thomassen, C.: Highly connected sets and the excluded grid theorem (Submitted)
Gorbunov, K.Y.: Context-free decidability of graphs that do not realize a plane lattice. Soviet Math. Dokl 43 (1), 53–57 (1991)
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic Aspects of Tree-Width. Journal of Algorithms 7, 309–322 (1986)
Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B 36, 49–64 (1984)
Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B 41, 92–114 (1986)
Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B 52, 153–190 (1991)
Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B 62, 323–348 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gorbunov, K.Y. (1998). An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor.. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_30
Download citation
DOI: https://doi.org/10.1007/10692760_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive