Kelmans, Alexander K.
Partition of a cubic 3-connected graphs into paths of length 2. ★★
Author(s): Kelmans
Problem Does every -connected cubic graph on vertices admit a partition into paths of length ?
Keywords:
Author(s): Kelmans
Keywords: