On certain polytopes associated with graphs

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

[2]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

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

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

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

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

[7]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[8]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[9]  R. Duffin.  Topology of series-parallel networks , 1965 .

[10]  Gert Sabidussi,et al.  The lexicographic product of graphs , 1961 .

[11]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[12]  J. Trotter.  Solution characteristics and algorithms for the vertex packing problem. , 1973 .

[13]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[14]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[15]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[16]  G. Dirac.  In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen† , 1960 .