I'm interested in the following problem.
Given an eulerian graph $G=(V,E)$, we are to find a partition of its edges $C_1, C_2, \ldots, C_k$ ($\cup_i C_i=E$ and $i \neq j \leftrightarrow C_i \cap C_j = \varnothing$), such that each $C_i$ forms a simple cycle in $G$ and $k$ is maximum possible.
In other words, we are to cover every edge of an eulerian graph with a maximum number of edge-disjoint simple cycles.
Is this problem well-known? Is there a known approach to solve it?