A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On some multigraph decomposition problems and their computational complexity
2004
Discrete Mathematics
Let H be a ÿxed simple graph. The H -decomposition computational problem is deÿned as follows: Given an input graph G, can its edge set be partitioned into isomorphic copies of H ? The complexity status of H -decomposition problems, where no parallel edges or loops are allowed in G or in H , has been thoroughly studied during the last 20 years and is now completely settled. The subject of this article is the complexity of multigraph decomposition, that is the case where multiple edges are
doi:10.1016/j.disc.2003.07.005
fatcat:dreuozdsina4lktobjb2oidtta