New graph classes of bounded clique-width

Theory of Computing Systems

Volumn 38, Issue 5, 2005, Pages 623-645

  Brandstädt, Andreas ^a   Dragan, Feodor F ^b   Le, Hoàng Oanh ^a   Mosca, Raffaele ^c  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b KENT STATE UNIVERSITY   (United States)

^c UNIVERSITY OF CHIETI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED TREEWIDTH; CLIQUE-WIDTH; COMPLETE CLASSIFICATION; COMPLEXITY RESULTS; GRAPH ALGORITHMS; INPUT GRAPHS; LINEAR TIME; MONADIC SECOND-ORDER LOGIC;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

GRAPH THEORY;

EID: 23844431921     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1154-6     Document Type: Review

References (38)

1. H.-J. Bandelt, H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory Sci: B 41 (1986), 182-208.
2. 5,Diamond)-Free graphs revisited: structure and linear time optimization, Discrete Appl. Math. 138 (2004), 13-27.
3. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique-width, Extended abstract in Conference Proceedings of WG '2002, pp.57-67, LNCS 2573, Springer-Verlag, Berlin (2003).
4. A. Brandstädt, C.T. Hoàng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Discrete Appl. Math. 131 (2003), 39-50.
5. 5,gem)-free graphs, accepted for Discrete Appl. Math.
6. 5,gem)-free graphs have bounded clique-width, accepted for Discrete Appl. Math.
7. A. Brandstädt, H.-O. Le, R. Mosca, Gem- and co-gem-free graphs have bounded clique-width, Internat. J. Found. Comput Sci. 15 (2004), 163-185.
8. A. Brandstädt, V.B. Le, J. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. Appl., Vol. 3, SIAM, Philadelphia, PA (1999).
9. A. Brandstädt, H.-O. Le, J.-M. Vanherpe, Structure and stability number of (chair,co-P,gem)-free graphs, Inform. Process. Lett. 86 (2003), 161-167.
10. A. Brandstädt, S. Mahfud, Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time, Inform. Process. Lett. 84 (2002), 251-259.
11. 5- and co-chair-free graphs, Discrete Appl. Math. 132 (2004), 47-65.
12. 4-sparse graphs, Discrete Appl. Math. 129 (2003), 521-532.
13. D.G. Cornell, M. Habib, J. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width ≤ 3 graphs, Extended abstract in Conference Proceedings of LATIN 2000, pp. 126-134, LNCS 1726, Springer-Verlag, Berlin (2000).
14. D.G. Cornell, H. Lerchs, L. Stewart-Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981), 163-174.
15. D.G. Cornell, Y. Perl, L.K. Stewart, Cographs: recognition, applications, and algorithms, Congr. Numer. 43 (1984), 249-258.
16. D.G. Cornell, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985), 926-934.
17. B. Courcelle, J. Engelfriet, G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993), 218-270.
18. B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique width, Theory Comput. Systems 33 (2000), 125-150.
19. B. Courcelle, S. Olariu, Upper bounds to the clique-width of graphs, Discrete Appl. Math. 101 (2000), 77-114.
20. C. De Simone, On the vertex packing problem, Graphs Combinatorics 9 (1993), 19-30.
21. S. Földes, P.L. Hammer, Split graphs, Cong. Numer. 19 (1977), 311-315.
22. 5)-free graphs, Discrete Math. 121 (1993), 7583.
23. 4-sparse graphs, Discrete Math. 165-166 (1997), 267-290.
24. J.-L. Fouquet, V. Giakoumakis, H. Thuillier, F. Maire, On graphs without PJ and PS, Discrete Math. 146 (1995), 33-44.
25. M.C. Golumbic, U. Rotics, On the clique-width of some perfect graph classes, Internat. J. Found. Comput. Sci. 11 (2000), 423-443.
26. A. Hertz, On a graph transformation which preserves the stability number, to appear in Yugoslav J. Oper. Res.
27. C.T. Hoàng, A Class of Perfect Graphs, M.Sc. Thesis, School of Computer Science, McGill University, Montreal (1983).
28. C.T. Hoàng, Perfect Graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal (1985).
29. C.T. Hoàng, B. Reed, Some classes of perfectly orderable graphs, J. Graph Theory 13 (1989), 445-463.
30. E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. 2 28 (1977), 417-420.
31. 4-sparse graphs, Discrete Appl. Math. 35 (1992), 115-129
32. Ö. Johansson, Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs, Congr. Numer. 132 (1998), 39-60; http://www.nada.kth.se/~ojvind/papers/CGTC98.pdf.
33. V.V. Lozin, Conic reduction of graphs for the stable set problem, Discrete Math. 222 (2000), 199-211.
34. N.V.R. Mahadev, U.N. Peled, Threshold graphs and related topics, Ann. Discrete Math. 56 (1995).
35. 4's, Internat. J. Found. Comput. Sci. 3 (1999), 329-348.
36. R.H. Möhring, F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Ann. Discrete Math. 19 (1984), 257-356.
37. M. Yannakakis, The complexity of the partial order dimension problem, SIAM J. Algebraic Discrete Methods 3 (1982), 351-358.
38. 5)free graphs, Rutcor Research Report RRR 22-2001 (2001); http://rutcor.rutgers.edu/~rrr.