Decompositions into linear forests and difference labelings of graphs (Q1327218)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decompositions into linear forests and difference labelings of graphs |
scientific article; zbMATH DE number 590195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions into linear forests and difference labelings of graphs |
scientific article; zbMATH DE number 590195 |
Statements
Decompositions into linear forests and difference labelings of graphs (English)
0 references
1 May 1995
0 references
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.
0 references
labeled graph
0 references
common-weight decomposition
0 references
