Frugal coloring in planar graphs with maximum degree 4 and 5

Boštjan Brešar, Přemysl Holub, Marko Jakovac +1

A proper coloring of vertices of a graph $G$ is called $t$-frugal if no color appears more than $t$ times in the neighborhood of any vertex of $G$. While $1$-frugal coloring coinci…