(P5,diamond)-free graphs revisited: Structure and linear time optimization

Discrete Applied Mathematics

Volumn 138, Issue 1-2, 2004, Pages 13-27

  Brandstädt, Andreas ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

(P5; Clique width of graphs; Diamond) free graphs; Maximum Weight Clique Problem; Maximum Weight Stable Set Problem; Modules and homogeneous sets in graphs; Prime graphs

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

(P5DIAMOND)-FREE GRAPHS; CLIQUE WIDTH OF GRAPHS; MAXIMUM WEIGHT CLIQUE PROBLEM; MAXIMUM WEIGHT STABLE SET PROBLEM; MODULES AND HOMOGENEOUS SETS IN GRAPHS; PRIME GRAPHS;

GRAPH THEORY;

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

References (27)

1. 5 , diamond)-free graphs, manuscript, 1995; Discrete Appl. Math., to appear.
2. Bandelt H.-J., Mulder H.M. Distance-hereditary graphs. J. Combin. Theory (B). 41:1986;182-208.
3. A. Brandstädt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, Extended abstract in: Theory of Computing Systems, Proceedings of WG2002, LNCS 2573 (2002) 57-67.
4. A. Brandstädt, C.T. Hoàng, J.-M. Vanherpe, On minimal prime extensions of a 4-vertex graph in a prime graph, manuscript, 2001.
5. 4) -free graphs with substitution, Rutcor Research Report RRR 28-2001, 2001 http://rutcor.rutgers.edu/̃rrr.
6. 5 ,gem)-free graphs: structure and stability number, 2002, submitted to Discrete Appl. Math.
7. A. Brandstädt, H.-O. Le, R. Mosca, Chordal co-gem-free graphs have bounded clique width, 2002, submitted to Discrete Appl. Math.
8. Brandstädt A., Le V.B., Spinrad J.P. Graph classes: a survey. SIAM Monographs on Discrete Mathematical Applications. Vol. 3:1999;SIAM, Philadelphia, PA.
9. Corneil D.G. The complexity of generalized clique packing. Discrete Appl. Math. 12:1985;233-239.
10. Corneil D.G., Lerchs H., Stewart-Burlingham L. Complement reducible graphs. Discrete Appl. Math. 3:1981;163-174.
11. Corneil D.G., Perl Y., Stewart L.K. Cographs. recognition, applications, and algorithms Congr. Numer. 43:1984;249-258.
12. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14:1985;926-934.
13. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46:1993;218-270.
14. 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.
15. Courcelle B., Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101:2000;77-114.
16. 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, pp. 68-84.
17. Dahlhaus E., Gustedt J., McConnell R.M. Efficient and practical modular decomposition. J. Algorithms. 41(2):2001;360-387.
18. V. Giakoumakis, communicated, 2000.
19. Golumbic M.C. Trivially perfect graphs. Discrete Math. 24:1978;105-107.
20. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
21. Golumbic M.C., Rotics U. On the clique-width of perfect graph classes. Internat. J. Found. Comput. Sci. 11:2000;423-443.
22. Hoàng C.T., Reed B. Some classes of perfectly orderable graphs. J. Graph Theory. 13:1989;445-463.
23. Hammer P.L., Peled U.N., Sun X. Difference graphs. Discrete Appl. Math. 28:1990;35-44.
24. McConnell R.M., Spinrad J.P. Modular decomposition and transitive orientation. Discrete Math. 201:1999;189-241.
25. Spinrad J.P. Representations of Graphs, Book Manuscript. 1998;Vanderbilt University, Nashville, TN.
26. Wolk E.S. The comparability graph of a tree. Proc. AMS. 13:1962;789-795.
27. Yannakakis M. The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods. 3:1982;351-358.