On cuts and matchings in planar graphs

  title={On cuts and matchings in planar graphs},
  author={Francisco Barahona},
  journal={Math. Program.},
The convex hull of the incidence vectors of matchings in a graph has been characterized by Edmonds (1965). In his pioneering paper, Edmonds showed that exponentially many inequalities may be necessary. Several other polytopes related to combinatorial problems have been characterized by systems whose number of inequalities is exponential in the size of the problem. One example is the Cut Polytope for graphs not contractible to Ks, see Barahona and Mahjoub (1986a). In this paper we show that the… CONTINUE READING
48 Citations
13 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 13 references

On some weakly bipartite graphs," Operations Research Letters 2 (1983b) 239-242

  • F. Barahona
  • SlAM Journal on Optimization
  • 1988
Highly Influential
8 Excerpts

Mahjoub "On the Cut Polytope,

  • A.R.F. Barahona
  • (DIMACS, NJ,
  • 1990

Pulleyblank " The Traveling Salesman Problem in Graphs with 3edge cutsets

  • R. W.
  • Journal of the Association for Computing…
  • 1989

Mahjoub, "Compositions of graphs and polydedra II: Stable Sets,

  • Waterloo Waterloo, Ont, A. R. 1986b. F. Barahona
  • Research Report CORR 86-16,
  • 1988

Two terminal Steiner tree polyhedra,

  • M. Ball, W.R.W.G. Liu
  • Pulleyblank,
  • 1987

On odd cuts and planar multicommodity flows

  • P. D. Seymour
  • Proceedings of the London Mathematical Society
  • 1986

Uhry, "Compositions ion the bipartite subgraph polytope,

  • J. Fonlupt, J.P.A.R. Mahjoub
  • Mathematical Programming
  • 1984

Blocking and antiblocking pairs of polybedra Multicommodity network flows

  • A. R. Mahjoub J. Fonlupt, J. P. Uhry, D. R. Fulkerson
  • 1973

'A dual ascent approach to Steiner tree problems in graphs,

  • K. Wagner, Berlin
  • Mathematical Programming
  • 1970

Similar Papers

Loading similar papers…