Exact defective colorings of graphs

James Cumberbatch, Juho Lauri, Christodoulos Mitillos

An exact $(k,d)$-coloring of a graph $G$ is a coloring of its vertices with $k$ colors such that each vertex $v$ is adjacent to exactly $d$ vertices having the same color as $v$. T…