Weak Dynamic Coloring of Planar Graphs

Caroline Accurso, Vitaliy Chernyshov, Leaha Hand +2

The \textit{$k$-weak-dynamic number} of a graph $G$ is the smallest number of colors we need to color the vertices of $G$ in such a way that each vertex $v$ of degree $d(v)$ sees a…