Frugal Colouring of Graphs

Omid Amini, Louis Esperet, Jan Van Den Heuvel

A $k$-frugal colouring of a graph $G$ is a proper colouring of the vertices of $G$ such that no colour appears more than $k$ times in the neighbourhood of a vertex. This type of co…