A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062)
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: A polynomial time algorithm for strong edge coloring of partial \(k\)-trees |
scientific article; zbMATH DE number 2118345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for strong edge coloring of partial \(k\)-trees |
scientific article; zbMATH DE number 2118345 |
Statements
A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (English)
0 references
23 November 2004
0 references
Edge coloring
0 references
Strong matching
0 references
Strong edge coloring
0 references
Bounded tree-width
0 references
0 references
