Alspach, Brian

Hamilton decomposition of prisms over 3-connected cubic planar graphs ★★

Author(s): Alspach; Rosenfeld

\begin{conjecture} Every prism over a $3$-connected cubic planar graph can be decomposed into two Hamilton cycles. \end{conjecture}


Decomposing an even tournament in directed paths. ★★★

Author(s): Alspach; Mason; Pullman

\begin{conjecture} Every tournament $D$ on an even number of vertices can be decomposed into $\sum_{v\in V}\max\{0,d^+(v)-d^-(v)\}$ directed paths. \end{conjecture}


Syndicate content