Some properties of minimal imperfect graphs

Discrete Mathematics

Volumn 160, Issue 1-3, 1996, Pages 165-175

  Hoàng, Chính T ^a  

^a LAKEHEAD UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000517796     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00156-Q     Document Type: Article

References (30)

1. C. Berge, Les problèmes de coloration en théorie des graphes, Publ. Inst. Stat. Univ. Paris 9 (1960) 123-160.
2. C. Berge and V. Chvátal eds., Topics on perfect Graphs (North-Holland, Amsterdam, 1984).
3. R.G. Bland, H.-C. Huang and L.E. Trotter, Graphical properties related to minimal imperfection, Discrete Math. 27 (1979) 11-22.
4. M. Burlet and J. Fonlupt, Polynomial algorithm to recognize a Meyniel graph, in: C. Berge and V. Chvátal, eds., Topics on Perfect Graphs (Ann. Discrete Math. 21) (North-Holland, Amsterdam, 1984).
5. V. Chvátal, Star-cutsets and perfect graphs, J. Combin. Theory B 39 (1985) 189-199.
6. V. Chvátal, R.L. Graham, A.F. Perold and S.H. Whitesides, Combinatorial designs related to the perfect graph conjecture, Discrete Math. 26 (1979) 83-92.
7. V. Chvátal and N. Sbihi, Bull-free perfect graphs, Graphs Combin. 3 (1987) 127-140.
8. C. De Simone and A. Gallucio, New classes of perfect graphs, Discrete Math. 131 (1994) 67-79.
9. D.R. Fulkerson, Anti-blocking polyhedra, J. Combin. Theory B 12 (1972) 50-71.
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
11. R. Hayward, C.T. Hoàng and F. Maffray, Optimizing weakly triangulated graphs, Graphs Combin. 5 (1989) 339-349; see also Erratum, 6 (1990) 33-35.
12. C.T. Hoàng, Perfect graphs, Ph.D. Thesis, Department of Computer Science, McGill University, 1985.
13. C.T. Hoàng, On a conjecture of Meyniel, J. Combin. Theory B 42 (1987) 302-312.
14. C.T. Hoàng, On a sibling-structure of perfect graphs, J. Combin. Theory B 49 (1990) 282-286.
15. C.T. Hoàng and F. Maffray, Opposition graphs are strict quasi-parity graphs, Graphs Combin. 5 (1989) 83-85.
16. S. Hougardy, Perfekte graphen. Diplomarbeit, 1991, Forschunginstitut fuer Diskrete Mathematik, Universitaet Bonn.
17. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math. 2 (1972) 253-267.
18. H. Meyniel, On the perfect graph conjecture, Discrete Math. 16 (1976) 334-342.
19. H. Meyniel, A new property of critical imperfect graphs and some consequences, Eur. J. Combin. 8 (1987) 313-316.
20. H. Meyniel and S. Olariu, A new conjecture about minimal imperfect graphs, J. Combin. Theory B 47 (1989) 244-247.
21. S. Olariu, No antitwins in minimal graphs, J. Combin. Theory B 45 (1988) 255-257.
22. S. Olariu, On the strong perfect graphs conjecture, J. Graph. Theory 12 (1988) 169-176.
23. M.W. Padberg, Perfect zero-one matrices, Math. Programming 6 (1974) 180-196.
24. 1,3-free graphs, J. Combin. Theory B 21 (1976) 212-223.
25. 4 - e)-free graphs, J. Combin. Theory B 26 (1979) 98-100.
26. G. Ravindra, Meyniel graphs are strongly perfect, J. Combin. Theory B 33 (1982) 187-190.
27. B. Reed, A note on even pairs, Discrete Math. 65 (1987) 317-318.
28. L. Sun, Two classes of perfect graphs, J. Combin. Theory B 53 (1991) 273-292.
29. A. Tucker, Critical perfect graphs and perfect 3-chromatic graphs, J. Combin. Theory B 23 (1977) 143-149.
30. 4 - e)-free graphs, J. Combin. Theory B 42 (1987) 313-318.