Star coloring of sparse graphs

Yuehua Bu, Daniel W. Cranston, Mickaël Montassier +2

A proper coloring of the vertices of a graph is called a \emph{star coloring} if the union of every two color classes induces a star forest. The star chromatic number ${\chi }_s(G)$ is t…