Packing paths of length at least two Original Research Article

We give a simple proof for Kanekoʹs theorem which gives a sufficient and necessary condition for the existence of vertex disjoint paths in a graph, each of length at least two, that altogether cover all vertices of the original graph. Moreover we generalize this theorem and give a formula for the maximum number of vertices that can be covered by such a path system.