Isomorphic decomposition of complete graphs into linear forests

The well-known theorem of Kirkman states that every complete graph K_2n of order 2n is 1-factorable or, equivalently, is nK₂-decomposable. This result is generalized to any linear forest of size n without isolated vertices.