On Modular Edge Colourings of Graphs

Gaétan Berthe, Marthe Bonamy, Fábio Botler +5

Given a graph $G$ and an integer $k\ge 2$, let ${\chi }_k^{\prime }(G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in each colour class, the subgraph ind…