Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number

Arash Ahadi, Ali Dehghan

A 2-hued coloring of a graph $G$ (also known as conditional $(k,2)$-coloring and dynamic coloring) is a coloring such that for every vertex $v\in V(G)$ of degree at least $2$, the…