Notes on Perfect Graphs

[1]  V. Chvátal.  On the strong perfect graph conjecture , 1976 .

[2]  G. Dirac.  On rigid circuit graphs , 1961 .

[3]  Manfred W. Padberg,et al.  Perfect zero–one matrices , 1974, Math. Program..

[4]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[5]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[6]  Kathleen Barbara Cameron.  Polyhedral and algorithmic ramifications of antichains , 1982 .

[7]  Sue Whitesides,et al.  A classification of certain graphs with minimal imperfection properties , 1984, Discret. Math..

[8]  V. Chvátal.  Perfectly Ordered Graphs , 1984 .

[9]  Ronald L. Graham,et al.  Combinatorial designs related to the strong perfect graph conjecture , 1979, Discret. Math..

[10]  Sue Whitesides,et al.  An Algorithm for Finding Clique Cut-Sets , 1981, Inf. Process. Lett..

[11]  D. Seinsche.  On a property of the class of n-colorable graphs , 1974 .

[12]  Vašek Chvátal.  A Semi-Strong Perfect Graph Conjecture , 1984 .

[13]  Henry Meyniel,et al.  On the perfect graph conjecture , 1976, Discret. Math..

[14]  L. Lovász.  A Characterization of Perfect Graphs , 1972 .

[15]  M. Burlet,et al.  Polynomial algorithm to recognize a Meyniel graph , 1984 .

[16]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[17]  Leslie E. Trotter,et al.  Graphical properties related to minimal imperfection , 1979, Discret. Math..