Equitable and m-bounded coloring of split graphs
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 .
Unable to display preview. Download preview PDF.
- 5.Hajnal, A., Szemerédi, E.: Proof of a conjecture of Erdös. In Combinatorial Theory and Its Applications. Vol II (P. Erdös, A Rényi and V. T. Sós, eds), Colloq. Math. Soc. János Bolyai 4, North-Holland, Amsterdam (1970) 601–623Google Scholar
- 6.Lih, K. W., Wu, P. L.: On equitable coloring of bipartite graphs. Discrete Math. (to appear)Google Scholar
- 7.Meyer, W.: Equitable coloring. Amer. Math. Monthly 80 (1973) 920–922Google Scholar