![](/files/happy5.png)
Alspach, Brian
Hamilton decomposition of prisms over 3-connected cubic planar graphs ★★
Conjecture Every prism over a
-connected cubic planar graph can be decomposed into two Hamilton cycles.
![$ 3 $](/files/tex/4aaf85facb6534fd470edd32dbdb4e28f6218190.png)
Keywords:
Decomposing an even tournament in directed paths. ★★★
Author(s): Alspach; Mason; Pullman
Conjecture Every tournament
on an even number of vertices can be decomposed into
directed paths.
![$ D $](/files/tex/b8653a25aff72e3dacd3642492c24c2241f0058c.png)
![$ \sum_{v\in V}\max\{0,d^+(v)-d^-(v)\} $](/files/tex/f29ede79dfd513de0399afb27fcb533427bb3982.png)
Keywords:
![Syndicate content Syndicate content](/misc/feed.png)