Equitable Colorings of $l$-Corona Products of Cubic Graphs

Hanna Furmańczyk, Marek Kubale

A graph $G$ is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one.…