  Substantial efforts have been made to compute or estimate the minimum number
$c(G)$ of cycles needed to partition the edges of an Eulerian graph. We give an
equivalent characterization of Eulerian graphs of treewidth $2$ and with
maximum degree $4$. This characterization enables us to present a linear time
algorithm for the computation of $c(G)$ for all $G$ in this class.
