Pages that link to "Item:Q1245970"
From MaRDI portal
The following pages link to The matroids with the max-flow min-cut property (Q1245970):
Displaying 50 items.
- A survey on flows in graphs and matroids (Q298967) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Lattice flows in networks (Q522926) (← links)
- On the planar integer two-flow problem (Q585080) (← links)
- A new infinite family of minimally nonideal matrices (Q618293) (← links)
- Ideal clutters (Q697573) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- On some weakly bipartite graphs (Q800231) (← links)
- Antisymmetric flows in matroids (Q852703) (← links)
- A characterization of minimal non-Seymour graphs (Q898107) (← links)
- The Klein bottle and multicommodity flows (Q920100) (← links)
- The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Lehman matrices (Q1025999) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- A decomposition theory for matroids. III. Decomposition conditions (Q1086242) (← links)
- An O(m n) algorithm for regular set-covering problems (Q1095668) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- Directed cut transversal packing for source-sink connected graphs (Q1101126) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids (Q1124594) (← links)
- Algebraic flows in regular matroids (Q1138993) (← links)
- Matroids and multicommodity flows (Q1161527) (← links)
- Decomposition of group flows in regular matroids (Q1163563) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- Chords and disjoint paths in matroids (Q1241753) (← links)
- A note on the production of matroid minors (Q1249179) (← links)
- A two-commodity cut theorem (Q1250228) (← links)
- Solution of two fractional packing problems of Lovász (Q1260046) (← links)
- A catalog of minimally nonideal matrices (Q1298742) (← links)
- A rounding algorithm for integer programs (Q1327212) (← links)
- A note on clutter partitions (Q1332941) (← links)
- A short proof of Seymour's characterization of the matroids with the max-flow min-cut property (Q1403921) (← links)
- Packing odd circuits in Eulerian graphs (Q1403922) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- On a min--max theorem on bipartite graphs (Q1422438) (← links)
- Clutters with \(\tau_ 2 \Relbar 2\tau\) (Q1801694) (← links)
- A decomposition of the matroids with the max-flow min-cut property (Q1823147) (← links)
