Complexity and algorithms for injective edge-coloring in graphs

Florent Foucaud, Hervé Hocquard, Dimitri Lajou

An injective $k$-edge-coloring of a graph $G$ is an assignment of colors, i.e. integers in $\{1,\dots ,k\}$, to the edges of $G$ such that any two edges each incident with one d…