Structure and stability number of chair-, co-P- and gem-free graphs revisited

Information Processing Letters

Volumn 86, Issue 3, 2003, Pages 161-167

  Brandstädt, Andreas ^a   Le, Hoàng Oanh ^a   Vanherpe, Jean Marie ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b Centre Hospitalier du Mans   (France)

Author keywords

(Chair, co P, gem) free graphs; Clique width of graphs; Graph algorithms; Maximum Weight Stable Set; Modular decomposition; Prime graphs

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; PROBLEM SOLVING; SET THEORY;

GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0037449036     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00487-8     Document Type: Article

References (22)

1. 5, diamond)-free graphs revisited: Structure and linear time optimization, Manuscript 2000, to appear in Discrete Appl. Math.
2. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, Manuscript 2001, to appear in Conference Proceedings of WG'2002.
3. A. Brandstädt, C.T. Hoàng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Manuscript 2001, to appear in Discrete Appl. Math.
4. Brandstädt A., Le V.B., Spinrad J. Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl. 3:1999;SIAM, Philadelphia.
5. Brandstädt A., Mahfud S. 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.
6. Corneil D.G., Lerchs H., Stewart-Burlingham L. Complement reducible graphs. Discrete Appl. Math. 3:1981;163-174.
7. Corneil D.G., Perl Y., Stewart L.K. Cographs: recognition, applications, and algorithms. Congressus Numer. 43:1984;249-258.
8. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14:1985;926-934.
9. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. Syst. Sci. 46:1993;218-270.
10. Courcelle B., Makowsky J.A., Rotics U. Linear time solvable optimization problems on graphs of bounded clique width. Theory Comput. Systems. 33:2000;125-150.
11. Courcelle B., Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101:2000;77-114.
12. Cournier A., Habib M. A new linear algorithm for modular decomposition, LIRMM, University Montpellier (1995); Preliminary version. Trees in Algebra and Programming - CAAP'94. Lecture Notes in Comput. Sci. 787:1994;68-84.
13. Cournier A., Habib M. A new linear algorithm for modular decomposition, LIRMM, University Montpellier (1995); Preliminary version. Trees in Algebra and Programming - CAAP'94. Lecture Notes in Comput. Sci. 787:1994;68-84.
14. Dahlhaus E., Gustedt J., McConnell R.M. Efficient and practical modular decomposition. J. Algorithms. 41:(2):2001;360-387.
15. 4-sparse graphs. Theoret. Comput. Sci. 180:1997;269-286.
16. C.T. Hoàng, A class of perfect graphs, Ms.Sc. Thesis, School of Computer Science, McGill University, Montreal, 1983.
17. C.T. Hoàng, Perfect Graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, 1985.
18. Hoàng C.T., Reed B. Some classes of perfectly orderable graphs. J. Graph Theory. 13:1989;445-463.
19. Lozin V.V. Conic reduction of graphs for the stable set problem. Discrete Math. 222:2000;199-211.
20. McConnell R.M., Spinrad J. Modular decomposition and transitive orientation. Discrete Math. 201:1999;189-241.
21. Möhring R.H., Radermacher F.J. Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math. 19:1984;257-356.
22. 5 )-free graphs. Rutcor Research Report RRR 22-2001, 2001 http://rutcor.rutgers.edu/̃rrr.