## Taiwanese Journal of Mathematics

### THE EQUITABLE CHROMATIC THRESHOLD OF THE CARTESIAN PRODUCT OF BIPARTITE GRAPHS IS AT MOST 4

#### Abstract

A graph $G$ is equitably $k$-colorable if its vertex set can be partitioned into $k$ independent sets, any two of which differ in size by at most 1. We prove a conjecture of Lin and Chang which asserts that for any bipartite graphs $G$ and $H$, their Cartesian product $G\Box H$ is equitably $k$-colorable whenever $k\ge 4$.

#### Article information

Source
Taiwanese J. Math., Volume 18, Number 3 (2014), 773-780.

Dates
First available in Project Euclid: 10 July 2017

https://projecteuclid.org/euclid.twjm/1499706439

Digital Object Identifier
doi:10.11650/tjm.18.2014.3645

Mathematical Reviews number (MathSciNet)
MR3213385

Zentralblatt MATH identifier
1357.05047

#### Citation

Yan, Zhidan; Lin, Wu-Hsiung; Wang, Wei. THE EQUITABLE CHROMATIC THRESHOLD OF THE CARTESIAN PRODUCT OF BIPARTITE GRAPHS IS AT MOST 4. Taiwanese J. Math. 18 (2014), no. 3, 773--780. doi:10.11650/tjm.18.2014.3645. https://projecteuclid.org/euclid.twjm/1499706439

#### References

• B.-L. Chen, K.-W. Lih and J.-H. Yan, Equitable coloring of interval graphs and products of graphs, arXiv:0903.1396v1.
• H. Furmańczyk, Equitable coloring of graph products, Opuscula Math., \bf26 (2006), 31-44.
• K.-W. Lih, The equitable coloring of graphs, in: Handbook of Combinatorial Optimization, D.-Z. Du, P. Pardalos (eds.), Vol. 3, Kluwer, Dordrecht, 1998, pp. 543-566.
• W.-H. Lin and G. J. Chang, Equitable colorings of Cartesian products of graphs, Discrete Appl. Math., \bf160 (2012), 239-247.
• W. Meyer, Equitable coloring, Amer. Math. Monthly, \bf80 (1973), 920-922.
• G. Sabidussi, Graphs with given group and given graph-theoretical properties, Canad. J. Math., \bf9 (1957), 512-525.