Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids

References

• Bridges W. G., Ryser H. J. Combinatorial designs and related systems. J. Algebra (1969) 13:432–446Crossref, Google Scholar
• Cornuéjols G., Guenin B. Ideal binary clutters, connectivity, and a conjecture of Seymour. SIAM J. Discrete Math. (2002) 15:329–352Crossref, Google Scholar
• Cornuéjols G., Guenin B., Margot F. The packing property. Math. Programming Ser. A (2000) 89:113–126Crossref, Google Scholar
• Edmonds J., Johnson E. L. Matching, Euler tours and the Chinese postman. Math. Programming (1973) 5:88–124Crossref, Google Scholar
• Ford L. R., Fulkerson D. R.Flows in Networks (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Goemans M. X., Ramakrishnan V. S. Minimizing submodular functions over families of sets. Combinatorica (1995) 15:499–513Crossref, Google Scholar
• Guenin B. A characterization of weakly bipartite graphs. J. Combin. Theory Series B (2001) 83:112–168Crossref, Google Scholar
• Hoffman A. J. A generalization of max-flow min-cut theorem. Math. Programming (1974) 6:352–359Crossref, Google Scholar
• Hu T. C. Multicommodity network flows. Oper. Res. (1963) 11:344–360Link, Google Scholar
• Kingan S. R. A generalization of a graph result of D. W. Hall. Discrete Math. (1997) 173:129–135Crossref, Google Scholar
• Kwan M. K. Graphic programming using odd or even points (in Chinese). Acta Mathematica Sinica (1960) 10:263–266Google Scholar
• Lehman A. A solution of the Shannon switching game. J. SIAM (1964) 12(4):687–725Google Scholar
• Lehman A. On the width-length inequality. Math. Programming (1979) 17:403–417Crossref, Google Scholar
• Lehman A., Cook W., Seymour P. D. On the width-length inequality and degenerate projective planes. Polyhedral Combinatorics, DIMACS Ser. in Discrete Math. Theoret. Comput. Sci. (1990) 1:101–105Google Scholar
• Oxley J. G.Matroid Theory (1992) (Oxford University Press, New York) Google Scholar
• Schrijver A.Theory of Linear and Integer Programming (1986) (Wiley InterScience)Wiley InterScience Series in Discrete Mathematics and OptimizationGoogle Scholar
• Seymour P. D. The matroids with the max-flow min-cut property. J. Combin. Theory, Ser. B (1977) 23:189–222Crossref, Google Scholar
• Seymour P. D. Matroids and multicommodity flows. Eur. J. Combin. (1981) 257–290Crossref, Google Scholar
• Tutte W. T. A homotopy theorem for matroids: Vol. I, II. Amer. Math. Soc. (1958) 88:144–174Google Scholar