1. On colouring the nodes of a network;Brooks;Proc. Cambridge Phil. Soc.,1941
2. Chromatic coloring with a maximum color class;Chen;Discrete Math.,2008
3. Equitable coloring and the maximum degree;Chen;Eur. J. Combin.,1994
4. B.-L. Chen, K.-W. Lih, C.-H. Yen, Equivalence of two conjectures on equitable coloring of graphs (submitted for publication).
5. Proof of a conjecture of Erdős;Hajnal,1970