A cycle cover of a graph G is a collection of cycles in G such that every edge is in at least one cycle. The length of a cycle cover is the sum of lengths of the cycles. The smallest length of a cycle cover of G is denoted cc(G). How to find cc(G)? And we have any solution for this problem?