A characterization of weakly bipartite graphs

Journal of Combinatorial Theory. Series B

Volumn 83, Issue 1, 2001, Pages 112-168

  Guenin, B ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Binary clutters; Ideal clutters; Minors; Weakly bipartite graphs

Indexed keywords

EID: 0035185680     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2051     Document Type: Article

References (19)

1. 5
2. Combinatorial designs and related systems
3. Ideal 0, 1 matrices
4. Composition of graphs and the bipartite subgraph polytope
5. Multi-commodity flows and polyhedra
6. Weakly bipartite graphs and the max-cut problem
7. Reducibility among combinatorial problems
8. A solution of the Shannon switching game
9. On the width-length inequality
10. On the width-length inequality and degenerate projective planes
11. A catalog of minimally nonideal matrices
12. On combinatorial properties of binary spaces
13. Lehman's forbidden minor characterization of ideal 0-1 matrices
14. The forbidden minors of binary clutters
15. The matroids with the Max-Flow Min-Cut property
16. Matroids and multicommodity flows
17. On Lehman's width-length characterization