Injective edge-coloring of sparse graphs

Baya Ferdjallah, Samia Kerdjoudj, Andre Raspaud

An injective edge-coloring $c$ of a graph $G$ is an edge-coloring such that if $e_1$, $e_2$, and $e_3$ are three consecutive edges in $G$ (they are consecutive if they form a path…