New bounds for locally irregular chromatic index of bipartite and subcubic graphs

Borut Lužar, Jakub Przybyło, Roman Soták

A graph is \textit{locally irregular} if the neighbors of every vertex $v$ have degrees distinct from the degree of $v$. \textit{locally irregular edge-coloring} of a graph $G$ is…