A survey on flows in graphs and matroids
From MaRDI portal
Publication:298967
DOI10.1016/j.dam.2015.10.035zbMath1339.05165OpenAlexW2185242172MaRDI QIDQ298967
Publication date: 21 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.035
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22) Flows in graphs (05C21)
Related Items (1)
Cites Work
- Three-edge-colouring doublecross cubic graphs
- Edge-colouring seven-regular planar graphs
- Edge-colouring eight-regular planar graphs
- Packing six \(T\)-joins in plane graphs
- The extremal length of a network
- Decomposition of regular matroids
- Matroids and multicommodity flows
- The matroids with the max-flow min-cut property
- Tutte's edge-colouring conjecture
- Packing odd circuits in Eulerian graphs
- A characterization of weakly bipartite graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial Optimization
- On Odd Cuts and Plane Multicommodity Flows
- Packing odd T‐joins with at most two terminals
- Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
- Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour
- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
- The Cycling Property for the Clutter of Odd st-Walks
- On the algebraic theory of graph colorings
- Maximum matching and a polyhedron with 0,1-vertices
- Feasibility of Two Commodity Network Flows
- Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
- Multi-Commodity Network Flows
This page was built for publication: A survey on flows in graphs and matroids
