Equitable Colorings of Vertex-Weighted Graphs

Siddharth Barman, Vignesh Viswanathan

We study a generalization of the classical Hajnal-Szemerédi theorem to vertex-weighted graphs. Given a graph with nonnegative vertex weights, a coloring is called $\hat{I}\pm$-approximate…