均匀染色最近的一些进展

Abstract

An equitable coloring of a graph G is a proper vertex coloring of G such that the sizes of any two color classes differ by at most one. This is a survey of results obtained in very recent years on equitable coloring of graphs, together with a comprehensive bibliography.