Kelmans, Alexander K.

Partition of a cubic 3-connected graphs into paths of length 2. ★★

Author(s): Kelmans

Problem Does every $3$ -connected cubic graph on $3k$ vertices admit a partition into $k$ paths of length $2$ ?

Keywords:

Posted by fhavet
updated March 4th, 2013