Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- 2-Matchings and 2-covers of hypergraphs
- A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
- A quick proof of Seymour's theorem on t-joins
- Brick decompositions and the matching rank of graphs
- Covering directed and odd cuts
- Dual integrality in b-matching problems
- Finding thet-join structure of graphs
- Linear Systems for Constrained Matching Problems
- Matching, Euler tours and the Chinese postman
- On Cutting Planes
- On Odd Cuts and Plane Multicommodity Flows
- On the structure of factorizable graphs
- On total dual integrality
- The ellipsoid method and its consequences in combinatorial optimization
- The matroids with the max-flow min-cut property
- Total dual integrality and b-matchings
- Total dual integrality implies local strong unimodularity
Cited in
(8)- On the feedback vertex set polytope of a series-parallel graph
- On a min--max theorem on bipartite graphs
- Minimum T-cuts and optimal T-pairings
- Trader multiflow and box-TDI systems in series-parallel graphs
- Undirected distances and the postman-structure of graphs
- The Schrijver system of the flow cone in series-parallel graphs
- Generalized edge packings
- On shortest T-joins and packing T-cuts
This page was built for publication: The Schrijver system of odd join polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101352)
