A two-commodity cut theorem

DOI10.1016/0012-365X(78)90116-4zbMath0387.05022OpenAlexW2084806930MaRDI QIDQ1250228

P. D. Seymour

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90116-4

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Connectivity (05C40)

Related Items

Families of cuts with the MFMC-property ⋮ Distances and cuts in planar graphs ⋮ Matroids and multicommodity flows ⋮ The ellipsoid method and its consequences in combinatorial optimization ⋮ Short proofs on multicommodity flows and cuts ⋮ Ideal clutters ⋮ The biobjective undirected two-commodity minimum cost flow problem ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ A new strategy for the undirected two-commodity maximum flow problem ⋮ On the hardness of finding near-optimal multicuts in directed acyclic graphs ⋮ Metrics and undirected cuts

Cites Work

• A short proof of the two-commodity flow theorem
• The matroids with the max-flow min-cut property
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On Two Commodity Network Flows
• Bottleneck extrema
• Two-commodity cut-packing problem
• Multi-Commodity Network Flows
• Unnamed Item
• Unnamed Item