Short cycle covers and the cycle double cover conjecture

Ury Jamshy*, Michael Tarsi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)197-204
Number of pages8
JournalJournal of Combinatorial Theory. Series B
Volume56
Issue number2
DOIs
StatePublished - Nov 1992

Fingerprint

Dive into the research topics of 'Short cycle covers and the cycle double cover conjecture'. Together they form a unique fingerprint.

Cite this