A survey on flows in graphs and matroids

DOI10.1016/J.DAM.2015.10.035MaRDI QIDQ298967zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• A characterization of weakly bipartite graphs
• Combinatorial optimization. Packing and covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Decomposition of regular matroids
• Edge-colouring eight-regular planar graphs
• Edge-colouring seven-regular planar graphs
• Feasibility of Two Commodity Network Flows
• Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour
• Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
• Matroids and multicommodity flows
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• Maximum matching and a polyhedron with 0,1-vertices
• Multi-Commodity Network Flows
• On Odd Cuts and Plane Multicommodity Flows
• On the algebraic theory of graph colorings
• Packing odd T‐joins with at most two terminals
• Packing odd circuits in Eulerian graphs
• Packing six \(T\)-joins in plane graphs
• Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
• The Cycling Property for the Clutter of Odd st-Walks
• The extremal length of a network
• The matroids with the max-flow min-cut property
• Three-edge-colouring doublecross cubic graphs
• Tutte's edge-colouring conjecture

Cited in

(6)

• Single commodity-flow algorithms for lifts of graphic and cographic matroids
• Tension continuous maps -- their structure and applications
• Lattice of integer flows and the poset of strongly connected orientations for regular matroids
• A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
• Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic 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)