On r-equitable coloring of complete multipartite graphs

From MaRDI portal
Publication:390073




Abstract: Let rgeqslant0 and kgeqslant1 be integers. We say that a graph G has an r-equitable k-coloring if there exists a proper k-coloring of G such that the sizes of any two color classes differ by at most r. The least k such that a graph G has an r-equitable k-coloring is denoted by chir=(G), and the least n such that a graph G has an r-equitable k-coloring for all kgeqslantn is denoted by chir=(G). In this paper, we propose a necessary and sufficient condition for a complete multipartite graph G to have an r-equitable k-coloring, and also give exact values of chir=(G) and chir=(G).









This page was built for publication: On \(r\)-equitable coloring of complete multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390073)