On the cut polytope

This publication has 8 references indexed in Scilit:

• Facets of the Bipartite Subgraph Polytope
  Mathematics of Operations Research, 1985
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles
  Mathematical Programming, 1984
• The max-cut problem on graphs not contractible to K5
  Operations Research Letters, 1983
• On the computational complexity of Ising spin glass models
  Journal of Physics A: General Physics, 1982
• Matroids and Multicommodity Flows
  European Journal of Combinatorics, 1981
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
  SIAM Journal on Computing, 1975
• On the notion of balance of a signed graph.
  The Michigan Mathematical Journal, 1953