Taiwanese Journal of Mathematics

ON $r$-EQUITABLE COLORING OF COMPLETE MULTIPARTITE GRAPHS

Chih-Hung Yen

Full-text: Open access

Abstract

Let $r \geqslant 0$ and $k \geqslant 1$ be integers. We say that a graph $G$ has an $r$-equitable $k$-coloring if there exists a proper $k$-coloring of $G$ such that the sizes of any two color classes differ by at most $r$. The least $k$ such that a graph $G$ has an $r$-equitable $k$-coloring is denoted by $\chi_{r=}(G)$, and the least $n$ such that a graph $G$ has an $r$-equitable $k$-coloring for all $k \geqslant n$ is denoted by $\chi^*_{r=}(G)$. In this paper, we propose a necessary and sufficient condition for a complete multipartite graph $G$ to have an $r$-equitable $k$-coloring, and also give exact values of $\chi_{r=}(G)$ and $\chi^*_{r=}(G)$.

Article information

Source
Taiwanese J. Math., Volume 17, Number 3 (2013), 991-998.

Dates
First available in Project Euclid: 10 July 2017

Permanent link to this document
https://projecteuclid.org/euclid.twjm/1499705995

Digital Object Identifier
doi:10.11650/tjm.17.2013.2666

Mathematical Reviews number (MathSciNet)
MR3072273

Zentralblatt MATH identifier
1280.05048

Subjects
Primary: 05C15: Coloring of graphs and hypergraphs

Keywords
equitable coloring $r$-equitable coloring complete multipartite graph $r$-equitable chromatic number $r$-equitable chromatic threshold

Citation

Yen, Chih-Hung. ON $r$-EQUITABLE COLORING OF COMPLETE MULTIPARTITE GRAPHS. Taiwanese J. Math. 17 (2013), no. 3, 991--998. doi:10.11650/tjm.17.2013.2666. https://projecteuclid.org/euclid.twjm/1499705995


Export citation

References

  • B.-L. Chen, K.-W. Lih and P.-L. Wu, Equitable coloring and the maximum degree, Europ. J. Combin., 15 (1994), 443-447.
  • B.-L. Chen and C.-H. Yen, Equitable $\Delta$-coloring of graphs, Discrete Math., 312 (2012), 1512-1517.
  • A. Hertz and B. Ries, On $r$-equitable colorings of trees and forests, submitted, 2011. (http://www.gerad.ca/alainh/Ries.pdf)
  • H. A. Kierstead and A. V. Kostochka, Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture, Combinatorica, 30 (2010), 201-216.
  • P. C. B. Lam, W. C. Shiu, C. S. Tong and Z. F. Zhang, On the equitable chromatic number of complete $n$-partite graphs, Discrete Appl. Math., 113 (2001), 307-310.
  • W.-H. Lin and G. J. Chang, Equitable colorings of Kronecker products of graphs, Discrete Appl. Math., 158 (2010), 1816-1826.
  • K.-W. Lih, The equitable coloring of graphs, in: Handbook of Combinatorial Optimization, D.-Z. Du and P. M. Pardalos (eds.), Vol. 3, Kluwer Academic Publishers, 1998, pp. 543-566.
  • K.-W. Lih and P.-L. Wu, On equitable coloring of bipartite graphs, Discrete Math., 151 (1996), 155-160.
  • W. Meyer, Equitable coloring, Amer. Math. Monthly, 80 (1973), 920-922.
  • C.-H. Wu, On the equitable-coloring of the complete $t$-partite graphs, Master's thesis, Tunghai University, Taiwan, 1994.