Graph coloring conditions for the existence of solutions to the timetable problem

DOI10.1145/361082.361092zbMath0281.68023OpenAlexW2062529965MaRDI QIDQ4766587

G. A. Neufeld, John Tartar

Publication date: 1974

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361082.361092

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)

Related Items (8)

School timetabling for quality student and teacher schedules ⋮ A multi-stage IP-based heuristic for class timetabling and trainer rostering ⋮ An existential problem of a weight-controlled subset and its application to school timetable construction ⋮ Programação da grade de horário em escolas de ensino fundamental e médio ⋮ Linear combinations of heuristics for examination timetabling ⋮ A graph colouring model for assigning a heterogeneous workforce to a given schedule ⋮ Pre-processing techniques for resource allocation in the heterogeneous case ⋮ A generalized class-teacher model for some timetabling problems

This page was built for publication: Graph coloring conditions for the existence of solutions to the timetable problem