On minimal imperfect graphs without induced P5

Discrete Applied Mathematics

Volumn 94, Issue 1-3, 1999, Pages 9-33

  Barré, Vincent ^a   Fouquet, Jean Luc ^a  

^a UNIVERSITÉ DU MAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005850130     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00012-8     Document Type: Article

References (38)

1. G. Bacsó, Alpha-critical edges in perfect graphs, manuscript, Eötvös Loránd University, Budapest, Hungary, 1989 (in Hungarian).
2. 5-free minimal imperfect graphs, Discrete Math., in press.
3. C. Berge, Färbung von Graphen, deren sämtlich bzw. deren ungerade Kreise starr sind, Zeit. Martin Luther Univ. Halle-Wittenberg 10 (1961) 114-115.
4. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1985.
5. M. Bertschi, B.A. Reed, A note on even pairs, Discrete Math. 65 (1987) 317-318.
6. M. Bertschi, B.A. Reed, A note on even pairs 71 (1988) 187.
7. R.G. Bland, H.-C. Huang, L.E. Trotter Jr., Graphical properties related to minimal imperfection, Discrete Math. 27 (1979) 11-22.
8. V. Chvátal, Star-cutsets and perfect graphs, J. Combin. Theory Ser. B 39 (1985) 189-199.
9. V. Chvátal, Problems concerning perfect graphs, 1st Workshop on Perfect Graphs, Princeton, 1993.
10. V. Chvátal, P. Erdos, A note on Hamiltonian circuits, Discrete Math. 2 (1972) 111-113.
11. V. Chvátal, N. Sbihi, Bull-free Berge graphs are perfect, Graphs Combin. 3 (1987) 127-139.
12. C. De Simone, A. Gallucio, New classes of Berge perfect graphs, Discrete Math. 131 (1994) 67-79.
13. J. Fonlupt, J.-P. Uhry, Transformations which preserve perfectness and H-perfectness of graphs, Ann. of Discrete Math. 16 (1982) 83-95.
14. 5, Discrete Math. 146 (1995) 33-44.
15. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar. 18 (1967) 25-66.
16. R. Giles, L.E. Trotter, A. Tucker, The strong perfect graph theorem for a class of partitionable graphs, in: C. Berge, V. Chvátal (Eds.), Topics on perfect graphs, North-Holland, Amsterdam, 1984, pp. 161-167.
17. R.B. Hayward, Murky graphs, J. Combin. Theory Ser. B 49 (1990) 200-235.
18. C.T. Hoàng, Some properties of minimal imperfect graphs, Discrete Math. 160 (1996) 165-175.
19. L. Lovász, A characterization of perfect graphs, J. Combin. Theory Ser. B 13 (1972) 95-98.
20. A. Lubiw, Short-chorded and perfect graphs, J. Combin. Theory Ser. B 51 (1991) 24-33.
21. 5, Graphs Combin. 10 (1994) 179-184.
22. F. Maffray, M. Preissmann, Split neighbourhood graphs and the perfect graphs conjecture, J. Combin. Theory Ser. B 63 (1995) 294-309.
23. F. Maire, Des polyominos aux graphes parfaits; contribution à l'étude des propriétés combinatoires de ces structures, Ph.D. Thesis, Univ. Paris 6, 1993.
24. H. Meyniel, On the perfect graph conjecture, Discrete Math. 16 (1976) 334-342.
25. H. Meyniel, A new property of critical imperfect graphs and some consequences, Eur. J. Combin. 8 (1987) 313-316.
26. E. Olaru, Beiträge zur Theorie der Perfekten Graphen, Elektron. Informationsverarbeitung Kybernet. 8 (1972) 147-172.
27. E. Olaru, Zur Charakterisierung Perfekter Graphen, Elektron. Informationsverarbeitung Kybernet. 9 (1973) 543-548.
28. S. Olariu, On the strong perfect graph conjecture, J. Graph Theory 12 (1988) 169-176.
29. S. Olariu, The strong perfect graph conjecture for pan-free graphs, J. Combin. Theory Ser. B 47 (1989) 187-191.
30. E. Olaru, H. Sachs, Contributions to a characterization of the structure of perfect graphs, in: C. Berge, V. Chvátal (Eds.), Topics on Perfect Graphs, North-Holland, Amsterdam, 1984.
31. M. Padberg, Perfect zero-one matrices, Math. Prog. 6 (1974) 180-196.
32. A. Sassano, Chair-free Berge graphs are Perfect, Graphs Combin. 13 (4) (1997) 369-395.
33. A. Sebo, Forcing colorations and the perfect graph conjecture, in: E. Balas, G. Cornuéjols, R. Kannan (Eds.), Integer Programming and Combinatorial Optimization 2, Mathematical Programming Society and Carnegie Mellon University, 1992.
34. A. Sebo, The connectivity of minimal imperfect graphs, Report no. 93799, For-schungsinstitut für Diskrete Mathematik, Bonn, 1993.
35. D. Seinsche, On a property of the class of n-colorable graphs, J. Combin. Theory Ser. B 16 (1974) 191-193.
36. L. Sun, Two classes of perfect graphs, J. Combin. Theory Ser. B 53 (1991) 273-292.
37. 4-free graphs, in: C. Berge, V. Chvátal (Eds.), Topics on Perfect Graphs, North-Holland, Amsterdam, 1984, pp. 149-157.
38. 4 - e)-free graphs, J. Combin. Theory Ser. B 42 (1987) 313-318.