Recognizing dart-free perfect graphs

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1315-1338

  Chvatal V ^a   Fonlupt, Jean ^a   Sun, L ^a   Zemirline, Abdallah ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Perfect graphs

Indexed keywords

ALGORITHMS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

DART-FREE GRAPHS;

GRAPH THEORY;

EID: 0036588879     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799354771     Document Type: Article

References (13)

1. C. Berge, Perfect graphs, in Six Papers on Graph Theory, Indian Statistical Institute, Calcutta, India, 1963, pp. 1-21.
2. C. Berge, Une application de la théorie des graphes à un problème de codage, in Automata Theory, E.R. Caianiello, ed., Academic Press, New York, 1966, pp. 25-34.
3. C. Berge, The history of the perfect graphs, Southeast Asian Bull. Math., 20 (1996), pp. 5-10.
4. C. Berge, Motivations and history of some of my conjectures, Discrete Math., 165/166 (1997), pp. 61-70.
5. A. Brandstädt, V.B. LE, and J.P. Spinrad, Graph Classes: A Survey, SIAM Monogr. Discrete Math. Appl. 3, SIAM, Philadelphia, PA, 1999.
6. V. Chvátal and N. Sbihi, Recognizing claw-free perfect graphs, J. Combin. Theory Ser. B, 44 (1988), pp. 154-176.
7. M. Conforti and M.R. Rao, Structural properties and decomposition of linear balanced matrices, Math. Programming, 55 (1992), pp. 129-168.
8. 4-{e}-free graphs, Rev. Maghrèbine Math., 1 (1992), pp. 167-202.
9. 4-{e}-free graphs, Rev. Maghrébine Math., 2 (1993), pp. 1-26.
10. 1,3-free graphs, J. Combin. Theory Ser. B, 21 (1976), pp. 212-223.
11. L. Sun, Two classes of perfect graphs, J. Combin. Theory Ser. B, 53 (1991), pp. 273-292.
12. 4-{e}-free graphs, J. Combin. Theory Ser. B, 42 (1987), pp. 313-318.
13. S.H. Whitesides, An algorithm for finding clique cut-sets, Inform. Process. Lett., 12 (1981), pp. 31-32.