"The shortest cycle cover conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with m edges can be covered by cycles of total length at most 7m/5 = 1.400m. We show that every cubic bridgeless graph has a cycle cover of total length at most 34m/21, which is about 1.619m, and every bridgeless graph with minimum degree three has a cycle cover of total length at most 44m/27, which is about 1.630m."@en . . . "24" . "\u0160\u00E1mal, Robert" . . . "Nejedl\u00FD, Pavel" . "SIAM Journal of Discrete Mathematics" . "[094126E2E9F5]" . . . "P(1M0545), P(GA201/09/0197), Z(MSM4977751301)" . "Kaiser, Tom\u00E1\u0161" . . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . . "26"^^ . "1" . . "5"^^ . . "The shortest cycle cover conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with m edges can be covered by cycles of total length at most 7m/5 = 1.400m. We show that every cubic bridgeless graph has a cycle cover of total length at most 34m/21, which is about 1.619m, and every bridgeless graph with minimum degree three has a cycle cover of total length at most 44m/27, which is about 1.630m." . "cycle cover; cycle double cover; shortest cycle cover"@en . . "287205" . . . "0895-4801" . "Short cycle covers of graphs with minimum degree three"@en . "RIV/49777513:23520/10:00503290" . "RIV/49777513:23520/10:00503290!RIV11-GA0-23520___" . "1"^^ . "23520" . . . . "Short cycle covers of graphs with minimum degree three" . "Short cycle covers of graphs with minimum degree three" . "Lidick\u00FD, Bernard" . . "Kr\u00E1l', Daniel" . . "Short cycle covers of graphs with minimum degree three"@en .