Name
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. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1007/BF02187697 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Discrete Comput Geom,Directed Network,Incidence Vector,Positive Edge,Duplicate Edge | Graph,Discrete mathematics,Combinatorics,Electronic circuit,Mathematics | Journal |
Volume | Issue | ISSN |
1 | 1 | 0179-5376 |
Citations | PageRank | References |
1 | 0.52 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan J. Hoffman | 1 | 184 | 59.62 |
| Carl W. Lee | 2 | 103 | 35.15 |