TY - JOUR
T1 - Short cycle covers and the cycle double cover conjecture
AU - Jamshy, Ury
AU - Tarsi, Michael
PY - 1992/11
Y1 - 1992/11
N2 - The assertion of the long standing cycle double cover conjecture is shown to be true if either one of the following statements holds: 1. (1) Every graph G=(V,E) with no isthmus has a cycle cover, whose length does not exceed 7 5|E|. 2. (2) There exists an integer k≥9 such that every regular matroid M, which admits a k-nowherer zero flow, has a cycle cover of length at most 2( 1-1 k)|M|. The values in (1) and (2) have been mentioned in several previous articles as the largest known lengths of shortest cycle covers for the corresponding families of matroids.
AB - The assertion of the long standing cycle double cover conjecture is shown to be true if either one of the following statements holds: 1. (1) Every graph G=(V,E) with no isthmus has a cycle cover, whose length does not exceed 7 5|E|. 2. (2) There exists an integer k≥9 such that every regular matroid M, which admits a k-nowherer zero flow, has a cycle cover of length at most 2( 1-1 k)|M|. The values in (1) and (2) have been mentioned in several previous articles as the largest known lengths of shortest cycle covers for the corresponding families of matroids.
UR - http://www.scopus.com/inward/record.url?scp=38249010311&partnerID=8YFLogxK
U2 - 10.1016/0095-8956(92)90018-S
DO - 10.1016/0095-8956(92)90018-S
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:38249010311
SN - 0095-8956
VL - 56
SP - 197
EP - 204
JO - Journal of Combinatorial Theory. Series B
JF - Journal of Combinatorial Theory. Series B
IS - 2
ER -