A characterization of weakly bipartite graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 9-22

  Guenin, Bertrand ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY;

BIPARTITE GRAPHS; LABELED GRAPHS; ODD CYCLE;

INTEGER PROGRAMMING;

EID: 0009785508     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_2     Document Type: Conference Paper

References (20)

1. F. Barahona. On the complexity of max cut. Rapport de Recherche No. 186, Mathematiques Appliqués et Informatiques, Université Scientifique et Medicale de Grenoble, France, 1980.
2. 5. Oper. Res. Lett., 2:107-111, 1983.
3. W. G. Bridges and H. J. Ryser. Combinatorial designs and related systems. J. Algebra, 13:432-446, 1969.
4. G. Cornuéjols and B. Novick. Ideal 0, 1 matrices. J. Comb. Theory Ser. B, 60:145-157, 1994.
5. J. Fonlupt, A. R. Mahjoub, and J. P. Uhry. Composition of graphs and the bipartite subgraph polytope. Research Report No. 459, Laboratoire ARTEMIS (IMAG), Université de Grenoble, Grenoble, 1984.
6. A. M. H. Gerards. Graphs and Polyhedra: Binary Spaces and Cutting Planes. PhD thesis, Tilburg University, 1988.
7. A. M. H. Gerards. Multi-commodity flows and polyhedra. CWI Quarterly, 6(3), 1993.
8. M. Grötschel and W. R. Pulleyblank. Weakly bipartite graphs and the max-cut problem. Operations Research Letters, 1:23-27, 1981.
9. B. Guenin. A characterization of weakly bipartite graphs. Working paper, GSIA, Carnegie Mellon Univ., Pittsburgh, PA 15213, 1997.
10. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
11. A. Lehman. A solution of the Shannon switching game. J. SIAM, 12(4):687-725, 1964.
12. A. Lehman. On the width-length inequality, mimeographic notes. Mathematical Programming, 17:403-417, 1979.
13. A. Lehman. On the width-length inequality and degenerate projective planes. In W. Cook and P.D. Seymour, editors, Polyhedral Combinatorics, DIMACS Series in Discrete Math. and Theoretical Computer Science, Vol. 1, pages 101-105, 1990.
14. C. Luetolf and F. Margot. A catalog of minimally nonideal matrices. Mathematical Methods of Operations Research, 1998. To appear.
15. B. Novick and A. Sebö. On Combinatorial Properties of Binary Spaces. IPCO Proceedings, 1995.
16. M. W. Padberg. Lehman’s forbidden minor characterization of ideal 0−1 matrices. Discrete Math. 111:409-420, 1993.
17. P. D. Seymour. The forbidden minors of binary clutters. J. of Combinatorial Theory B, 22:356-360, 1976.
18. P. D. Seymour. The matroids with the max-flow min-cut property. J. Comb. Theory Ser. B, 23:189-222, 1977.
19. P. D. Seymour. Matroids and multicommodity flows. European J. of Combinatorics, 257-290, 1981.
20. P. D. Seymour. On Lehman’s width-length characterization. In W. Cook, and P. D. Seymour, editors, Polyhedral Combinatorics, DIMACS Series in Discrete Math. and Theoretical Computer Science, Vol. 1, pages 107-117, 1990.