Short Cycle Covers of Cubic Graphs and Graphs with Minimum Degree Three

Tomas Kaiser, Daniel Kral, Bernard Lidicky +2

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$…