A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs

We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin's original proof.

[1]  Paul D. Seymour,et al.  The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[2]  Martin Grötschel,et al.  Weakly bipartite graphs and the Max-cut problem , 1981, Oper. Res. Lett..

[3]  Alfred Lehman,et al.  The Width-Length Inequality and Degenerate Projective Planes , 1990, Polyhedral Combinatorics.

[4]  Paul D. Seymour,et al.  On Lehman's Width-Length Characterization , 1990, Polyhedral Combinatorics.

[5]  Manfred W. Padberg,et al.  Lehman's forbidden minor characterization of ideal 0-1 matrices , 1993, Discret. Math..

[6]  S. Thomas McCormick,et al.  Integer Programming and Combinatorial Optimization , 1996, Lecture Notes in Computer Science.

[7]  Bertrand Guenin,et al.  A Characterization of Weakly Bipartite Graphs , 1998, Electron. Notes Discret. Math..