![](/files/happy5.png)
Sabidussi, Gert
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour. ★★
Author(s): Sabidussi
Conjecture Let
be an eulerian graph of minimum degree
, and let
be an eulerian tour of
. Then
admits a decomposition into cycles none of which contains two consecutive edges of
.
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ 4 $](/files/tex/1f1498726bb4b7754ca36de46c0ccdd09136d115.png)
![$ W $](/files/tex/48948390b5dc5ab9a52c0afaff3e950050be14a2.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ W $](/files/tex/48948390b5dc5ab9a52c0afaff3e950050be14a2.png)
Keywords:
![Syndicate content Syndicate content](/misc/feed.png)