Bound on shortest cycle covers

Deping Song, Xuding Zhu

Assume $G$ is a bridgeless graph. A cycle cover of $G$ is a collection of cycles of $G$ such that each edge of $G$ is contained in at least one of the cycles. The length of a cycle…