Odd decompositions of eulerian graphs

Edita Máčajová, Martin Škoviera

We prove that an eulerian graph $G$ admits a decomposition into $k$ closed trails of odd length if and only if and it contains at least $k$ pairwise edge-disjoint odd circuits and…