Equitable chromatic threshold of Kronecker products of complete graphs

Zhidan Yan, Wei Wang

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic threshold of a graph $G$, denoted by ${\chi }_{=}^{\ast }(G)$, is the…