A Network-Flow Feasibility Theorem and Combinatorial Applications
From MaRDI portal
Publication:3278679
DOI10.4153/CJM-1959-045-1zbMath0098.33604OpenAlexW2334536955MaRDI QIDQ3278679
Publication date: 1959
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1959-045-1
Related Items
Switchdec polyhedra ⋮ Multimodal transport network systems interface, interaction coordination: A specification for control systems integration ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Optimal \((0, 1)\)-matrix completion with majorization ordered objectives ⋮ Subgraphs and their degree sequences of a digraph ⋮ Matrices of zeros and ones ⋮ The rank formula of Nash-Williams as a source of covering and packing theorems ⋮ A principle of symmetry in networks ⋮ A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs
