The Tree-Width of Clique-Width Bounded Graphs without Kn,n

  • Frank Gurski
  • Egon Wanke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1928)


We proof that every graph of clique-width k which does not contain the complete bipartite graph Kn,n for some n > 1 as a subgraph has tree-width at most 3k(n - 1) - 1. This immediately implies that a set of graphs of bounded clique-width has bounded tree-width if it is uniformly l-sparse, closed under subgraphs, of bounded degree, or planar.


Polynomial Time Tree Decomposition Complete Bipartite Graph Label Graph Graph Property 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12308–340, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    H.L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1–45, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    B.D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, and U. Rotics. Polynomial time recognition of clique-width at most three graphs. In Proceedings of Latin American Symposium on Theoretical Informatics (LATIN’ 2000), volume 1776 of LNCS. Springer-Verlag, 2000.Google Scholar
  4. 4.
    B. Courcelle, J.A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique width, extended abstract. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1517 of LNCS, pages 1–16. Springer-Verlag, 1998.Google Scholar
  5. 5.
    B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77–114, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    B. Courcelle. The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications. submitted for publication, 2000.Google Scholar
  8. 8.
    D.G. Corneil, Y. Perl, and L.K. Stewart. A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4):926–934, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    M.C. Golumbic and U. Rotics. On the clique-width of perfect graph classes. In Proceedings of Graph-Theoretical Concepts in Computer Science, volume 1665 of LNCS, pages 135–147. Springer-Verlag, 1999.Google Scholar
  10. 10.
    F. Gurski. Algorithmische Charakterisierungen spezieller Graphklassen. Diplomarbeit, Heinrich-Heine-Universität, Düsseldorf, Germany, 1998.Google Scholar
  11. 11.
    Ö. Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition-relationships and results for random graphs. Congressus Numerantium, 132:39–60, 1998.Google Scholar
  12. 12.
    Ö. Johansson. NLC2 decomposition in polynomial time. In Proceedings of GraphTheoretical Concepts in Computer Science, volume 1665 of LNCS, pages 110–121.Springer-Verlag, 1999.Google Scholar
  13. 13.
    N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree width. Journal of Algorithms, 7:309–322, 1986.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    E. Wanke. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics, 54:251–266, 1994.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Frank Gurski
    • 1
  • Egon Wanke
    • 1
  1. 1.Department of Computer ScienceMathematical Institute, Heinrich-Heine-UniversityDüsseldorfGermany

Personalised recommendations