Algorithms for finding distance-edge-colorings of graphs (Q2457301): Difference between revisions
From MaRDI portal
Revision as of 11:10, 27 June 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