# Hajós, G.

## Decomposing an eulerian graph into cycles. ★★

Author(s): Hajós

\begin{conjecture} Every simple eulerian graph on $n$ vertices can be decomposed into at most $\frac{1}{2}(n-1)$ cycles. \end{conjecture}

Keywords: