A short proof of the two-commodity flow theorem

DOI10.1016/0095-8956(79)90012-1MaRDI QIDQ1132734zbMATH OpenOpenAlexFDO

Authors Paul 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)

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Multi-Commodity Network Flows
• The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems

Cited in

(9)

• Disjoint paths in graphs
• Short proofs on multicommodity flows and cuts
• A two-commodity cut theorem
• Coloring near-quadrangulations of the cylinder and the torus
• Disjoint paths in graphs. (Reprint)
• Three commodity flows in graphs
• Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
• Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
• Multicut problems in almost-planar graphs: the dependency of complexity on the demand pattern

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

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