On the computational complexity of strong edge coloring

A polynomial time algorithm for strong edge coloring of partial k-trees

Discrete Applied Mathematics

Algorithms for finding distance-edge-colorings of graphs

Journal of Discrete Algorithms

Local algorithms for edge colorings in UDGs

Theoretical Computer Science

Algorithms for finding distance-edge-colorings of graphs

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Strong edge-colouring and induced matchings

Information Processing Letters