Applications to Timetabling.

Burke, E. K., Kingston, J. H., & Werra, D. d. (2003). Applications to Timetabling. Handbook of Graph Theory.

Type

Reference work

Intellectual base

Reference work

Year

2003

Link

no authoritative link yet

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Primes

• Graph Coloring
  • Exam timetabling runs the same structure: items are courses, two conflict when a student is enrolled in both, the palette is the available time slots, and the chromatic number is the minimum number of exam periods.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:dfd3fba82843 · see in the full table