On Maximum Differential Coloring of Planar Graphs

M. Bekos, A. Das, M. Geyer +3

We study the \emph{maximum differential coloring problem}, where the vertices of an $n$-vertex graph must be labeled with distinct numbers ranging from $1$ to $n$, so that the mini…