On the mod $k$ chromatic index of graphs

Oothan Nweit, Daqing Yang

For a graph $G$ and an integer $k\ge 2$, a ${\chi }_k^{\prime }$-coloring of $G$ is an edge coloring of $G$ such that the subgraph induced by the edges of each color has all degrees congruent…