Sabidussi, Gert


Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour. ★★

Author(s): Sabidussi

\begin{conjecture} Let $G$ be an eulerian graph of minimum degree $4$, and let $W$ be an eulerian tour of $G$. Then $G$ admits a decomposition into cycles none of which contains two consecutive edges of $W$. \end{conjecture}

Keywords:

Syndicate content