Algorithms for finding distance-edge-colorings of graphs (Q2457301): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:03, 3 February 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
