DOI: 10.7494/opmath.2004.24.1.97 ISSN: 1232-9274

Edge decompositions of multigraphs into multi-2-paths

Jan Kratochvil, Zbigniew Lonc, Mariusz Meszka, Zdzisław Skupień

We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.

More from our Archive