Wolfgang W. Bein, Peter Brucker, et al.
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.
Wolfgang W. Bein, Peter Brucker, et al.
Mathematical Programming
Alan J. Hoffman
Linear Algebra and Its Applications
Alan J. Hoffman, Baruch Schieber
Discrete Applied Mathematics
Carl W. Lee
Israel Journal of Mathematics