On the structure and stability number of P5- and co-chair-free graphs

Discrete Applied Mathematics

Volumn 132, Issue 1-3, 2003, Pages 47-65

  Brandstädt, Andreas ^a   Mosca, Raffaele ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b NONE   (Italy)

Author keywords

Clique width of graphs; Maximum Weight Stable Set Problem on graphs; Modular decomposition; P5 and co chair free graphs; P5 and co P free graphs; Prime graphs

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

MAXIMUM WEIGHT STABLE SET (MWS);

GRAPH THEORY;

EID: 0142124740     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00389-5     Document Type: Conference Paper

References (39)

1. Alekseev V.E. A polynomial algorithm for finding maximum independent sets in fork-free graphs. Discrete Anal. Oper. Res. 6(4):1999;3-19.
2. 5,diamond)-free graphs, Manuscript, 1998 Discrete Math. 250:2002;1-22.
3. 5,diamond)-Free Graphs Revisited: Structure, bounded clique width and linear time optimization, Technical Report CS-09-01, University of Rostock, 2001, Discrete Appl. Math., to appear.
4. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, Extended abstract in: Graph-Theoretic Concepts in Computer Science, 28 International Workshop, WG 2002, LNCS 2573, pp. 57-67 full version accepted for Theory of Computing Systems.
5. A. Brandstädt, C.T. Hoàng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Technical Report CS-01-01, University of Rostock, 2001, Discrete Appl. Math., accepted.
6. 5,gem)-free graphs, Discrete Appl. Math., 2001 accepted.
7. Brandstädt A., Le V.B., Spinrad J. Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl. Vol. 3:1999;SIAM, Philadelphia.
8. A. Brandstädt, H.-O. Le, J.-M. Vanherpe, Structure and stability number of (Chair,Co-P,Gem)-free graphs revisited, Information Processing Letter 86 (2003) 161-167.
9. Brandstädt A., Lozin V.V. A note on. α -redundant vertices in graphs Discrete Appl. Math. 108:2001;301-308.
10. 4 -sparse graphs Discrete Appl Math. 129:2003;521-532.
11. Corneil D.G., Lerchs H., Stewart-Burlingham L. Complement reducible graphs. Discrete Appl. Math. 3:1981;163-174.
12. Corneil D.G., Perl Y., Stewart L.K. Cographs. recognition, applications, and algorithms Congr. Numer. 43:1984;249-258.
13. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14:1985;926-934.
14. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46:1993;218-270.
15. 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.
16. Courcelle B., Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101:2000;77-114.
17. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, LIRMM, University Montpellier, 1995, Preliminary version in: Trees in Algebra and Programming - CAAP '94, Lecture Notes in Computer Science, Vol. 787, Springer, Berlin, 1994, 68-84.
18. Dahlhaus E., Gustedt J., McConnell R.M. Efficient and practical modular decomposition. J. Algorithms. 41(2):2001;360-387.
19. De Simone C. On the vertex packing problem. Graphs Combin. 9:1993;19-30.
20. Farber M. On diameters and radii of bridged graphs. Discrete Math. 73:1989;249-260.
21. Foeldes S., Hammer P.L. Split graphs. Congr. Numer. 19:1977;311-315.
22. 5 ) -free graphs Discrete Math. 121:1993;75-83.
23. 4 -sparse graphs Discrete Math. 165-166:1997;267-290.
24. 5 Discrete Math. 146:1995;33-44.
25. 5 )-free graphs Discrete Appl. Math. 80:1997;255-261.
26. C.T. Hoàng, A class of perfect graphs, M.Sc. Thesis, School of Computer Science, McGill University, Montreal, 1983.
27. C.T. Hoàng, Perfect graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, 1985.
28. Hoàng C.T., Reed B. Some classes of perfectly orderable graphs. J. Graph Theory. 13:1989;445-463.
29. 4 -sparse graphs Discrete Appl. Math. 35:1992;115-129.
30. 5 - and banner-free graphs European J. Oper. Res. 125:2000;292-297.
31. 4 's Internat. J. Found. Comput. Sci. 10(3):1999;329-348.
32. McConnell R.M., Spinrad J. Modular decomposition and transitive orientation. Discrete Math. 201:1999;189-241.
33. Minty G.J. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory (B). 28:1980;284-304.
34. Möhring R.H., Radermacher F.J. Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math. 19:1984;257-356.
35. 5 -free graphs Inform. Process. Lett. 61:1997;137-143.
36. 5 -free graphs, Manuscript, 1997, Discrete Appl. Math., accepted.
37. Spinrad J.P. Representations of Graphs, Book Manuscript. 1998;Vanderbilt University, Nashville, TN.
38. Tsukiyama S., Ide M., Ariyoshi H., Shirakawa I. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6:1977;505-517.
39. Yannakakis M. The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods. 3:1982;351-358.