A short proof of the two-commodity flow theorem
From MaRDI portal
Publication:1132734
DOI10.1016/0095-8956(79)90012-1zbMath0419.90039MaRDI QIDQ1132734
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
90B10: Deterministic network models in operations research
94C15: Applications of graph theory to circuits and networks
Related Items
Three commodity flows in graphs, 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)
Cites Work