A two-commodity cut theorem

DOI10.1016/0012-365X(78)90116-4MaRDI QIDQ1250228zbMATH OpenOpenAlexFDO

Authors Paul 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) Connectivity (05C40) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• A short proof of the two-commodity flow theorem
• Bottleneck extrema
• Multi-Commodity Network Flows
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On Two Commodity Network Flows
• The matroids with the max-flow min-cut property
• Two-commodity cut-packing problem

Cited in

(11)

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

This page was built for publication: A two-commodity cut theorem

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