@Article{Kratochvil2004,
author = "Kratochvil, Jan and Lonc, Zbigniew and Meszka, Mariusz and Skupień, Zdzisław",
title = "Edge decompositions of multigraphs into multi-2-paths",
journal = "Opuscula Math.",
year = "2004",
volume = "24",
number = "1",
pages = "97--102",
doi = "http://dx.doi.org/10.7494/OpMath.2004.24.1.97",
url = "http://dx.doi.org/10.7494/OpMath.2004.24.1.97",
abstract = "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.",
keywords = "edge decomposition, multigraph, multipath, path, time complexity",
issn = "1232-9274"
}