A short proof of the two-commodity flow theorem

DOI10.1016/0095-8956(79)90012-1zbMath0419.90039OpenAlexW2076463556MaRDI QIDQ1132734

P. D. Seymour

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90012-1

zbMATH Keywords

directed graphmulti-commodity network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Three commodity flows in graphs ⋮ Disjoint paths in graphs ⋮ Coloring near-quadrangulations of the cylinder and the torus ⋮ Short proofs on multicommodity flows and cuts ⋮ Disjoint paths in graphs. (Reprint) ⋮ A two-commodity cut theorem

Cites Work

• The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems
• Multi-Commodity Network Flows
• Unnamed Item

This page was built for publication: A short proof of the two-commodity flow theorem