The Maximum k-Differential Coloring Problem

Michael Bekos, Stephen Kobourov, Michael Kaufmann +1

Given an $n$-vertex graph $G$ and two positive integers $d,k\in \mathbb{N}$, the ($d,kn$)-differential coloring problem asks for a coloring of the vertices of $G$ (if one exists)…