Skip to main content
SpringerLink
Log in

Clique-Width for Four-Vertex Forbidden Subgraphs

  • Conference paper
Fundamentals of Computation Theory (FCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3623))

Included in the following conference series:

  • 863 Accesses

Abstract

Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms. The notion of clique-width extends the one of treewidth, since bounded treewidth implies bounded clique-width. We give a complete classification of all graph classes defined by forbidden induced subgraphs of at most four vertices with respect to bounded or unbounded clique-width.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boliac, R., Lozin, V.V.: On the clique-width of graphs in hereditary classes. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 44–54. Springer, Heidelberg (2002)

    Google Scholar 

  2. Brandstädt, A.: (P5,diamond)-Free Graphs Revisited: Structure and Linear Time Optimization. Discrete Applied Math. 138, 13–27 (2004)

    Google Scholar 

  3. Brandstädt, A., Dragan, F.F., Le, H.-O., Mosca, R.: New graph classes of bounded clique-width. Extended abstract In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 57–67. Springer, Heidelberg (2004); full version appeared electronically in Theory of Computing Systems (2004)

    Google Scholar 

  4. Brandstädt, A., Hoàng, C.T., Le, V.B.: Stability number of bull- and chair-free graphs revisited. Discrete Applied Math. 131, 39–50 (2003)

    Article  MATH  Google Scholar 

  5. Brandstädt, A., Kratsch, D.: On the structure of (P5,gem)-free graphs. Discrete Applied Math. 145, 155–166 (2005)

    Article  MATH  Google Scholar 

  6. Brandstädt, A., Le, H.-O., Mosca, R.: Chordal co-gem-free graphs and (P5,gem)- free graphs have bounded clique-width. Discrete Applied Math. 145, 232–241 (2005)

    Google Scholar 

  7. Brandstädt, A., Le, H.-O., Mosca, R.: Gem- and co-gem-free graphs have bounded clique-width. Internat. J. of Foundations of Computer Science 15, 163–185 (2004)

    Article  MATH  Google Scholar 

  8. Brandstädt, A., Le, H.-O., Vanherpe, J.-M.: Structure and Stability Number of (Chair, Co-P, Gem)-Free Graphs. Information Processing Letters 86, 161–167 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl. vol. 3. SIAM, Philadelphia (1999)

    Google Scholar 

  10. Brandstädt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Combinatoria, LXVII, 273–281 (2003)

    Google Scholar 

  11. Brandstädt, A., Mahfud, S.: MaximumWeight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Information Processing Letters 84, 251–259 (2002)

    MATH  MathSciNet  Google Scholar 

  12. Brandstädt, A., Mosca, R.: On the Structure and Stability Number of P5- and Co-Chair-Free Graphs. Discrete Applied Math. 132, 47–65 (2004)

    Google Scholar 

  13. Brandstädt, A., Mosca, R.: On Variations of P4-Sparse Graphs. Discrete Applied Math. 129, 521–532 (2003)

    Google Scholar 

  14. Corneil, D.G., Lerchs, H., Stewart-Burlingham, L.K.: Complement reducible graphs. Discrete Applied Math. 3, 163–174 (1981)

    Article  MATH  Google Scholar 

  15. Corneil, D.G., Perl, Y., Stewart, L.K.: Cographs: recognition, applications, and algorithms. Congressus Numer. 43, 249–258 (1984)

    MathSciNet  Google Scholar 

  16. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Computing 14, 926–934 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  17. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. Syst. Sciences 46, 218–270 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  18. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. Theory of Computing Systems 33, 125–150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  19. Courcelle, B., Olariu, S.: Upper bounds to the clique-width of graphs. Discrete Appl. Math. 101, 77–114 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  20. Földes, S., Hammer, P.L.: Split graphs. Congres. Numer. 19, 311–315 (1977)

    Google Scholar 

  21. Fouquet, J.-L., Giakoumakis, V., Vanherpe, J.-M.: Bipartite graphs totally decomposable by canonical decomposition. Internat. J. Foundations of Computer Science 10, 513–533 (1999)

    Article  MathSciNet  Google Scholar 

  22. Gleason, A.M., Greenwood, R.E.: Combinatorial relations and chromatic graphs. Canadian J. Math. 7, 1–7 (1955)

    Article  MATH  MathSciNet  Google Scholar 

  23. Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Internat. J. of Foundations of Computer Science 11, 423–443 (2000)

    Article  MathSciNet  Google Scholar 

  24. Johansson, Ö.: Clique-Decomposition, NLC-Decomposition, and Modular Decomposition - Relationships and Results for Random Graphs. Congressus Numerantium 132, 39-60 (1998), http://www.nada.kth.se/~ojvind/papers/CGTC98.pdf

  25. Lozin, V.V.: Bipartite graphs without a skew star. Discrete Math. 257, 83–100 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  26. Makowsky, J.A., Rotics, U.: On the Clique-Width of Graphs with Few P4’s. Int. J. Foundations of Computer Science 10, 329–348 (1999)

    Google Scholar 

  27. McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201, 189–241 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  28. Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory (B) 28, 284–304 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  29. Möhring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Math. 19, 257–356 (1984)

    Google Scholar 

  30. Oum, S.-i.: Personal communication (2004)

    Google Scholar 

  31. Randerath, B.: The Vizing bound for the chromatic number based on forbidden pairs. Dissertation Thesis, RWTH, Aachen (1998)

    Google Scholar 

  32. Randerath, B., Schiermeyer, I., Tewes, M.: Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discrete Math. 251, 137–153 (2002)

    MATH  MathSciNet  Google Scholar 

  33. Sbihi, N.: Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile. Discrete Math. 29, 53–76 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  34. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic and Discrete Methods 3, 351–358 (1982)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Rostock, D-18051, Rostock, Germany

    Andreas Brandstädt

  2. LIACS, Leiden University, P.O. Box 9512, Leiden, 2300 RA, The Netherlands

    Joost Engelfriet

  3. Fachbereich Informatik, Technische Fachhochschule Berlin, D-13353, Berlin, Germany

    Hoàng-Oanh Le

  4. RUTCOR, Rutgers University, 640 Bartholomew Rd., Piscataway, NJ, 08854-8003, USA

    Vadim V. Lozin

Authors
  1. Andreas Brandstädt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hoàng-Oanh Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vadim V. Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Theoretische Informatik, Universität zu Lübeck, Germany

    Maciej Liśkiewicz

  2. Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23538, Lübeck, Germany

    Rüdiger Reischuk

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandstädt, A., Engelfriet, J., Le, HO., Lozin, V.V. (2005). Clique-Width for Four-Vertex Forbidden Subgraphs. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_17

Download citation

  • DOI: https://doi.org/10.1007/11537311_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28193-1

  • Online ISBN: 978-3-540-31873-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation