1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Eli Berger, Daniel Carter, Paul Seymour
A digraph G is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that…