Title
Fulkerson′s Conjecture and Circuit Covers
Abstract
It was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by six cycles (union of circuits) such that each edge is in exactly four cycles. We prove that if Fulkerson′s conjecture is true, then the edge-set of every bridgeless graph G can be covered by three cycles whose total length is at most 22 15 | E ( G )|. We also prove that there are infinitely many bridgeless graphs G whose edge-set cannot be covered by three cycles of total length less than 22 15 | E ( G )|.
Year
DOI
Venue
1994
10.1006/jctb.1994.1039
Journal of Combinatorial Theory, Series B
DocType
Volume
Issue
Journal
61
1
ISSN
Citations 
PageRank 
Journal of Combinatorial Theory, Series B
40
3.80
References 
Authors
0
2
Name
Order
Citations
PageRank
Genghua Fan1403.80
A. Raspaud234429.64