Paul Erdös, Siemion Fajtlowicz, et al.
Networks
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.
Paul Erdös, Siemion Fajtlowicz, et al.
Networks
Heinz Gröflin, Alan J. Hoffman
Combinatorica
Ilan Adler, Alan J. Hoffman, et al.
Discrete Applied Mathematics
Terrence R. Scott, Alan J. Hoffman
IEEE Transactions on Circuits and Systems