Alspach, Brian

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

Conjecture Every prism over a $3$ -connected cubic planar graph can be decomposed into two Hamilton cycles.

Keywords:

Posted by fhavet
updated March 12th, 2013

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.

Keywords:

Posted by fhavet
updated February 26th, 2013