Covers of eulerian graphs

It is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋ circuits such that each edge is covered an odd number of times. This settles a conjecture made by Chung in 1980.