Decomposing graphs into a constant number of locally irregular subgraphs

Julien Bensmail, Martin Merker, Carsten Thomassen

A graph is locally irregular if no two adjacent vertices have the same degree. The irregular chromatic index ${\chi }_{\mathrm{irr}}^{\prime }(G)$ of a graph $G$ is the smallest number of locally irre…