Alan J. Hoffman
Mathematical Programming
We discuss three equivalent formulations of a theorem of Seymour on nonnegative sums of circuits of a graph, and present a different (but not shorter) proof of Seymour's resut. © 1986 Springer-Verlag New York Inc.
Alan J. Hoffman
Mathematical Programming
Paul Erdös, Siemion Fajtlowicz, et al.
Networks
Alan J. Hoffman
J. Comb. Theory Ser. A
Carl W. Lee
Israel Journal of Mathematics