11123 Edmund Burke/D. Elliman/Rupert Weare: Automated scheduling of
university exams. Proc. IEE Coll. Resource Scheduling 1993,
digest 1933/144 (1933), 4p.

11124 Edmund Burke/D. Elliman/Rupert Weare: Extensions to a university
exam timetabling system. Proc. IJCAI '93 on Knowledge-Based Production,
Planning, Scheduling and Control 1993, 42-48.

11122 Edmund Burke/D. Elliman/Rupert Weare: A university timetabling
system based on graph colouring and constraint manipulation.
J. Res. Comp. Educ. 27 (1994), 1-18.

N. Christofides: An algorithm for the chromatic number of a graph.
Computer J. 14 (1971), 38-39.

J. Dyer/J. Mulvey: The implementation of an integrated optimization/
information system for academic departmental planning.
Manag. Sci. 22 (1976), 1332-1341.

A. Hertz/Dominique de Werra: Using tabu search techniques for graph
coloring. Computing 39 (1987), 345-351.

D. Matula/G. Marble/I. Isaacson: Graph colouring algorithms.
In Read 1972, ...

N. Mehta: The application of a graph coloring method to an examination
scheduling problem. Interfaces 11/5 (1981), 57-64.

J. Mulvey: A classroom/time assignment model.
Europ. J. Op. Res. 9 (1982), 64-70.

G. Neufeld/J. Tartar: Graph coloring conditions for the existence
of solutions to the timetable problem. Comm. ACM 17/8 (1974), 450-453.

R. Ostermann/Dominique de Werra: Some experiments with a timetabling
system. Op. Res. Spektrum 3 (1983), 199-204.

R. Read (ed.): Graph theory and computing. Academic Press 1972.

S. Selim: Split vertices in vertex coloring and their application
in developing a solution to the faculty timetable problem.
Computer J. 31/1 (1988), 76-82.

D. Welsh/M. Powell: An upper bound for the chromatic number of a graph
and its applications to timetabling problems. Comp. J. 10 (1967), 85-86.

Dominique de Werra: Restricted coloring models for timetabling.
Discrete Math. 165 (1997), 161-170.

Dominique de Werra/N. Mahadev: Preassignment requirements in chromatic
scheduling. Discrete Appl. Math. 76 (1997), 93-101.