1. McDiarmid, C.J.H.: The solution of a timetabling problem. J. Inst. Math. Appl. 9, 23–34 (1972)
2. Hajnal, A., Szemerdi, E.: Proof of a Conjecture of P. Erdös, Combinatorial Theory and its Applications, II North-Holland, Amsterdam, , pp. 601–623 (1970)
3. Lucas, E.: Récréations mathématiques, vol. 2, Gauthier-Villars, Paris (1883)
4. Hoffman, D.G., Rodger, C.A.: The chromatic index of complete multipartite graphs. J. Graph Theor. 16, 159–163 (1992)
5. Lam, P., Shiu, W.C., Tong, C.S., Zhang, Z.F.: On the equitable chromatic number of complete $$n$$-partite graphs. Discrete Appl. Math. 113, 307–310 (2001)