Paths
Decomposing a connected graph into paths. ★★★
Author(s): Gallai
Conjecture Every simple connected graph on vertices can be decomposed into at most paths.
Keywords:
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: