Packing odd circuits in eulerian graphs

Journal of Combinatorial Theory. Series B

Volumn 86, Issue 2, 2002, Pages 280-295

  Geelen, James F ^a   Guenin, Bertrand ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Evenly bipartite; Signed graphs; Strongly bipartite; Weakly bipartite

Indexed keywords

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

References (11)

1. G. Cornuéjols, Combinatorial optimization: packing and covering, "Regional Conference Series in Applied Mathematics," SIAM, Philadelphia, PA, 2001.
2. A.M.H. Gerards, Multi-commodity Flows and Polyhedra, CWI Quart. 6 (1993), 281-296.
3. A.M.H. Gerards and A. Sebo, "Multicommodity Flows on the Klein Bottle," 1992.
4. B. Guenin, A characterization of weakly bipartite graphs, J. Combin. Theory Ser. B. 83 (2001), 112-168.
5. B. Guenin, A short proof of Seymour's characterization of the matroids with the Max-Flow Min-Cut Property, J. Combin. Theory Ser. B., to appear.
6. T.C. Hu, Multicommodity network flows, Oper. Res. 11 (1963), 344-360.
7. M.V. Lomonosov, Combinatorial approaches to multiflow problems, Discrete Appl. Math. 11 (1985).
8. B. Rothschild and A. Whinston, Feasibility of two-commodity network flows, Oper. Res. 14 (1966), 1121-1129.
9. A. Schrijver, A short proof of Guenin's characterization of weakly bipartite graphs, preprint, 2001.
10. P.D. Seymour, The matroids with the Max-Flow Min-Cut Property, J. Combin. Theory Ser. B 23 (1977), 189 222.
11. P.D. Seymour, On odd cuts and plane multicommodity flows, Proc. London Math. Soc. Ser. 3 (1981), 198-192.