Chapter 3 - Perfect graphs

[1]  Clyde L. Monma,et al.  On perfect graphs and polyhedra with (0, 1)-valued extreme points , 1979, Math. Program..

[2]  Alan Tucker,et al.  BERGE'S STRONG PERFECT GRAPH CONJECTURE , 1979 .

[3]  K. R. Parthasarathy,et al.  The validity of the strong perfect-graph conjecture for (K4-e)-free graphs , 1979, J. Comb. Theory, Ser. B.

[4]  Dominique de Werra,et al.  On line perfect graphs , 1978, Math. Program..

[5]  Leslie E. Trotter,et al.  Line perfect graphs , 1977, Math. Program..

[6]  Alan Tucker,et al.  Critical perfect graphs and perfect 3-chromatic graphs , 1977, J. Comb. Theory, Ser. B.

[7]  Elefterie Olaru,et al.  Zur Theorie der perfekten Graphen , 1977, J. Comb. Theory, Ser. B.

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

[9]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

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

[11]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[12]  A. Tucker,et al.  Perfect Graphs and an Application to Optimizing Municipal Services , 1973 .

[13]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[14]  A. Tucker,et al.  The Strong Perfect Graph Conjecture for Planar Graphs , 1973, Canadian Journal of Mathematics.

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

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

[17]  D. R. Fulkerson,et al.  Anti-blocking polyhedra , 1972 .

[18]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[19]  J. Malitz,et al.  Embedding trees in the rationals. , 1970, Proceedings of the National Academy of Sciences of the United States of America.

[20]  C. Nash-Williams,et al.  Infinite graphs—A survey , 1967 .

[21]  Micha A. Peles.  On dilworth’s theorem in the in finite case , 1963 .

[22]  John B. Kelly,et al.  PATHS AND CIRCUITS IN CRITICAL GRAPHS. , 1954 .

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

[24]  Oliver Pretzel,et al.  Another proof of dilworth's decomposition theorem , 1979, Discret. Math..

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

[26]  Stanley Wagon,et al.  Infinite triangulated graphs , 1978, Discret. Math..

[27]  Manfred W. Padberg,et al.  A note on the total unimodularity of matrices , 1976, Discret. Math..

[28]  K. R. Parthasarathy,et al.  The strong perfect-graph conjecture is true for K1, 3-free graphs , 1976, J. Comb. Theory, Ser. B.

[29]  M. Padberg.  Almost integral polyhedra related to certain combinatorial optimization problems , 1976 .

[30]  A. Tamir,et al.  On totally unimodular matrices , 1976, Networks.

[31]  F. G. Commoner,et al.  A sufficient condition for a matrix to be totally unimodular , 1973, Networks.