Equitable neighbour-sum-distinguishing edge and total colourings

Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3

With any (not necessarily proper) edge $k$-colouring $\gamma :E(G)⟶\{1,\dots ,k\}$ of a graph $G$,one can associate a vertex colouring $\sigma \_\gamma$ given by $σ\_γ(v)=\sum\_{e\ni v…