A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062): Difference between revisions
From MaRDI portal
Latest revision as of 16:21, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial time algorithm for strong edge coloring of partial \(k\)-trees |
scientific article |
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