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