3 problems

Let $G$ be a nice graph, meaning that it has no component isomorphic to $K_2$, and let $d$ be a positive integer. A neighbour sum distinguishing $d$-relaxed $k$-edge-colouring is a…

Let $G$ be a nice graph, and let $d$ be a positive integer. A neighbour sum distinguishing $d$-relaxed $k$-edge-colouring is an edge-colouring with colours in $\{1,\ldots,k\}$ such…

Let $G$ be a simple finite graph with no isolated edge. A neighbour-sum-distinguishing labeling is an edge-labeling such that, for every edge $uv$, the sums of the labels of the ed…