Minimum Cycle Decomposition: A Constructive Characterization for Graphs of Treewidth Two with Node Degrees Two and Four

Irene Heinrich, Sven O. Krumke

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 characteriza…