Abstract
An equitable coloring of a graph is a proper coloring such that the sizes of color classes are as even as possible. An m-bounded coloring of a graph is a proper coloring such that the sizes of color classes are all bounded by a preassigned number m. Formulas for the equitable and m-bounded chromatic numbers of a split graph are established in this paper. It is proved that split graphs satisfy the equitable Δ-coloring conjecture in Chen, Lih and Wu [4].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
