On semi-P4-sparse graphs

Discrete Mathematics

Volumn 165-166, Issue , 1997, Pages 277-300

  Fouquet, Jean Luc ^a   Giakoumakis, Vassilis ^b  

^a UNIVERSITÉ DU MAINE   (France)

^b AMIENS UNIVERSITY HOSPITAL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17944390775     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00177-X     Document Type: Article

References (35)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Menlo Park, CA, 1974).
2. C. Berge, Färbung von Graphen, deren sämtlich bzw. ungerade Kreise starr sind (Zusammenfassung), Wiss. Z. Martin Luther Univ. Halle Wittenberg, Math. Nat. Reihe (1961) 114-115.
3. C. Berge, Sur une conjecture relative au problème des codes optimaux, Comm. 13e Assemblée générale de l'URSI, Tokyo, 1962.
4. A. Blass, Graphs with unique maximal dumpings, J. Graph Theory 2 (1978) 19-24.
5. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North Holland, New York, 1979).
6. H. Buer and R.H. Möhring, A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res. 8 (1983) 170-184.
7. V. Chvátal, C.T. Hoang, N.V.R Mahadev and D. de Werra, Four classes of perfectly orderable graphs, J. Graph Theory 11 (1987) 481-495.
8. A. Cournier and M. Habib, A New Linear Algorithm for Modular Decomposition, Lecture Notes in Computer Science, Vol. 787 (Springer, Berlin, 1994) 68-84.
9. D.G. Corneil and Y. Perl, Clustering and domination in perfect graphs, Discrete Appl. Math. 9 (1984) 27-39.
10. D.G. Corneil, H. Lerchs and L.K. Stewart, Complement Reducible Graphs, Discrete Appl. Math. 3 (1981) 163-174.
11. D.G. Corneil, H. Lerchs and L.K. Stewart, Cographs: recognition, applications and algorithms, Proc. 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, LSU, 1984.
12. D.G. Corneil, Y. Perl and L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
13. 5, Discrete Math. 146 (1995) 33-44.
14. T. Gallai, Transitiv orientierbar graphen, Acta Math. Acad. Sci. Hung. 18 (1967) 25-66.
15. 4-sparse graphs, Extended Abstract for the 4th Twente Workshop on Graphs and Combinatorial Optimization, June 1995.
16. M.C. Golumbic, The complexity of comparability graph recognition and coloring, Computing 18 (1977) 199-208.
17. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
18. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completness (Freeman, San Francisco, 1979).
19. M. Grötschel, L. Lovász and A. Schrijver, Polynomial algorithms for perfect graphs, in: C. Berge and V. Chvátal, eds., Topics on Perfect graphs, Math. Stud. Vol. 88 (1984) 325-356.
20. R.B. Hayward, Weakly triangulated graphs, J. Combin. Theory Ser. B 39 (1985) 200-208.
21. T. Hiragushi, On the dimension of partially ordered sets, Sci. Rep. Kanazawa Univ. 1 (1951) 77-94.
22. C.T. Hoáng, Doctoral Dissertation, Montreal, 1985.
23. 4-sparse graphs, Discrete Appl. Math. 35 (1992) 115-129.
24. R. Jamison and S. Olariu, A linear-time recognition algorithm for P4-sparse graphs, SIAM J. Comput. 21 (1992) 381-407.
25. 4-reducible graphs, Lecture Notes in Computer Sciences, Vol. 405 (Springer, Berlin, 1989) 1-19.
26. H. Lerchs, On cliques and kernels, Dept. of Computer Science, Univerity of Toronto, March 1971.
27. R.H. Möhring, Algorithmic aspects of comparability graphs and intervall graphs, in: I. Rival, Ed., Graphs and Order (Reidel, Dordrecht, 1985) 41-101.
28. R.M. McConnel and J. Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs, Dept. of Computer Science, University Colorado, CO, 1993.
29. R.H. Möhring and F.J. Radermacher, Substitution decomposition and connections with combinatorial optimization, Ann. Discrete Math. 19 (1984) 257-356.
30. J.H. Muller and J. Spinrad, Incremental modular decomposition, J. ACM 36 (1989) 1-19.
31. S. Olariu, On the closure of triangle-free graphs under substitution, Incom. Processing Lett., 34 (1990) 97-101.
32. G. Sabidussi, Graph derivates, Math. Z. 76 (1961) 385-401.
33. D. Seinsche, On a property of the class of n-colorable graphs, JCT 16 (1974) 191-193.
34. L. Sharpley, On Comitties (Springer, Berlin, 1967) 246-270.
35. 4-trees and substitution decomposition, Discrete Appl. Math. 39 (1992) 263-291.