A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2004.03.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083057776 / rank | |||
Normal rank | |||
Revision as of 00:52, 20 March 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
