Advertisement

An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor.

  • K. Yu. Gorbunov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1517)

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

Keywords

Planar Graph Inductive Condition Combinatorial Theory Connected Subgraph Interior Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Diestel, R., Jensen, T.R., Gorbunov, K.Y., Thomassen, C.: Highly connected sets and the excluded grid theorem (Submitted)Google Scholar
  3. 3.
    Gorbunov, K.Y.: Context-free decidability of graphs that do not realize a plane lattice. Soviet Math. Dokl 43 (1), 53–57 (1991)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic Aspects of Tree-Width. Journal of Algorithms 7, 309–322 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B 36, 49–64 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B 41, 92–114 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B 52, 153–190 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B 62, 323–348 (1994)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • K. Yu. Gorbunov
    • 1
  1. 1.Institute of New TechnologiesMoscowRussia

Personalised recommendations