A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Graphs with the circuit cover property
1994
Transactions of the American Mathematical Society
A circuit cover of an edge-weighted graph (G, p) is a multiset of circuits in G such that every edge e is contained in exactly p(e) circuits in the multiset. A nonnegative integer valued weight vector p is admissible if the total weight of any edge-cut is even, and no edge has more than half the total weight of any edge-cut containing it. A graph G has the circuit cover property if (G, p) has a circuit cover for every admissible weight vector p . We prove that a graph has the circuit cover
doi:10.1090/s0002-9947-1994-1181180-1
fatcat:uaye6cvoyndndfrydlexioo4nq