Decompositions into linear forests and difference labelings of graphs (Q1327218)

A decomposition of a labeled graph into parts, each part containing the edges having a common weight, is called a common-weight decomposition. The authors introduce three new classes of difference labeling problems which are characterized by aspects of the subgraphs generated by common- weight decompositions. These labelings and their relation to other common-weight decompositions are examined.