Algorithms for finding distance-edge-colorings of graphs (Q2457301): 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.jda.2006.03.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144580685 / rank | |||
Normal rank | |||
Revision as of 00:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for finding distance-edge-colorings of graphs |
scientific article |
Statements
Algorithms for finding distance-edge-colorings of graphs (English)
0 references
30 October 2007
0 references
approximation algorithm
0 references
distance-edge-coloring
0 references
partial \(k\)-trees
0 references
planar graphs
0 references
