Algorithms for finding distance-edge-colorings of graphs (Q2457301): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2006.03.020 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2006.03.020 / rank | |||
Normal rank | |||
Latest revision as of 18:23, 18 December 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
