Decompositions of a complete multidigraph into nonhamiltonian paths
Mariusz Meszka, Zdzisław Skupień · Journal of Graph Theory · 2005
Abstract For n ≥ 3, the complete n‐vertex multidigraph with any fixed multiplicity of edges is proved to be decomposable into nonhamiltonian (directed) paths of arbitrarily prescribed lengths (≤ n − 2) provided that the lengths sum up to the size of the multidigraph. © 2005 Wiley Periodicals, Inc. J Graph Theory