Journal of Combinatorics
Volume 8 (2017)
Cycle double covers and long circuits of graphs
Pages: 341 – 347
The 5-Cycle Double Cover Conjecture claims that every bridgeless graph has a cycle double cover which consists of at most 5 cycles. In this paper, we prove that if a cubic graph has a long circuit, then it has a 5-cycle double cover. Our main theorem partially strengthens some previously known results.
cycle double covers, $k$-cycle double covers, strong cycle double covers
2010 Mathematics Subject Classification