Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535)
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 to degree-constrained subgraphs are simply reducible to edge-colorings |
scientific article; zbMATH DE number 1346898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings |
scientific article; zbMATH DE number 1346898 |
Statements
Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (English)
0 references
14 March 2002
0 references
degree-constrained subgraphs decomposition
0 references
edge-coloring
0 references
0.9271771
0 references
0.9222733
0 references
0.89884543
0 references
0.8947179
0 references
0.89066094
0 references
0.8819437
0 references
