References
- C. Berge, Graphs and hypergraphs. New York: Elsevier, 1973.
- J.H. McDiarmid, “The solution of a timetabling problem,” J. Inst. Math. Appl., vol. 9, 1972, 23–34.
- D. de Werra, “On some combinatorial problems arising in scheduling.” CORS J., vol. 8, no. 3, 1970, 165–75.
- D. de Werra, “Balanced schedules,” INFOR J., vol. 9, no. 3, 1971, 230–7.
- D. de Werra, “How to color a graph.” To appear in the Proceedings of the NATO Advanced Study Institute on Combinatorial Programming, Versailles, Sept. 1974.