Cycle cover problem

Cycle cover problem --- задача о покрытии графа циклами.

Let [math]\displaystyle{ G = (V,E) }[/math] be a connected undirected graph. A non-negative cost or length is associated with each edge. The cycle cover problem consists in determining a least cost cover of [math]\displaystyle{ G }[/math] with simple cycles, each containing at least three different edges.