dept. Mathmatiques Appliques. USTHB

Algiers, Algeria This email address is being protected from spambots. You need JavaScript enabled to view it.




A k-equitable coloring of a graph G is a proper coloring of G with k colors such that the sizes of any two different classes of colors differ by at most one. The minimum integer k such that G admits a k-equitable coloring is called the equitable chromatic number of G and is denoted by χ=(G). In this paper, we determine the equitable chromatic numbers of the...



 Télécharger l'article : The equitable chromatic numbers of some graphs