Additive colorings of planar graphs

Tomasz Bartnicki, Bartłomiej Bosek, Sebastian Czerwiński +3

An \emph{additive coloring} of a graph $G$ is an assignment of positive integers $\{1,2,...,k\}$ to the vertices of $G$ such that for every two adjacent vertices the sums of number…