6 research outputs found
An upper bound for the equitable chromatic number of complete n-partite graphs
A proper vertex coloring of a graph is equitable if the size of color classes differ by at most one. The equitable chromatic number of is the smallest integer such that is equitable m-colorable. In this paper, we derive an upper bound for the equitable chromatic number of complete n-partite graph
Obituary - Richard Kenneth Guy, 1916-2020
PostprintPeer reviewe
Equitable and proportional coloring of trees
We show that almost all trees can be equitably 3-colored, that is, with three color classes of cardinalities differing by at most one. Also, except in some extreme cases, they can be 3-colored with color classes of sizes in given proportions. © 1983