Decompositions of a complete multidigrap
✍
Mariusz Meszka; Zdzisław Skupień
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 116 KB
## 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 Per