Frugal coloring of graphs revisited

Boštjan Brešar, Wenjie Hu, Babak Samadi

Given a graph $G$ and a positive integer $t$, an independent set $S\subseteq V(G)$ is $t$-frugal if every vertex has at most $t$ neighbors in $S$. A $t$-frugal coloring of $G$ is a…