Wolfgang W. Bein, Peter Brucker, et al.
Mathematical Programming
Paper
On the cone of nonnegative circuits
Abstract
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.
Related
B.Curtis Eaves, Alan J. Hoffman, et al.
Mathematical Programming
Louis J. Billera, Carl W. Lee
European Journal of Combinatorics
Alan J. Hoffman
Advances in Computational Mathematics