A survey on flows in graphs and matroids

DOI10.1016/J.DAM.2015.10.035zbMATH Open1339.05165OpenAlexW2185242172MaRDI QIDQ298967FDOQ298967

Authors: Bertrand Guenin 

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

Recommendations

• scientific article; zbMATH DE number 3862930
• scientific article; zbMATH DE number 508835
• A generalized cut-condition for multiflows in matroids
• The matroids with the max-flow min-cut property
• scientific article; zbMATH DE number 4212067

zbMATH Keywords

binary matroidssigned graphsflowsminimax relations

Mathematics Subject Classification ID

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) Flows in graphs (05C21) Signed and weighted graphs (05C22)

Cites Work

• Decomposition of regular matroids
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Maximum matching and a polyhedron with 0,1-vertices
• The extremal length of a network
• Tutte's edge-colouring conjecture
• Three-edge-colouring doublecross cubic graphs
• On the algebraic theory of graph colorings
• Matroids and multicommodity flows
• The matroids with the max-flow min-cut property
• Packing odd circuits in Eulerian graphs
• A characterization of weakly bipartite graphs
• Combinatorial optimization. Packing and covering
• 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
• Edge-colouring seven-regular planar graphs
• Edge-colouring eight-regular planar graphs
• Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
• The Cycling Property for the Clutter of Odd st-Walks
• Feasibility of Two Commodity Network Flows
• Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
• Multi-Commodity Network Flows
• Packing six \(T\)-joins in plane graphs

Cited In (4)

• Tension continuous maps -- their structure and applications
• Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
• A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
• Degree Bounded Matroids and Submodular Flows

This page was built for publication: A survey on flows in graphs and matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298967)