| Article ID: | iaor19921806 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 3 |
| Start Page Number: | 301 |
| End Page Number: | 312 |
| Publication Date: | Mar 1992 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Schreuder Jan A.M. |
| Keywords: | timetabling, graphs |
Competitions are defined as a set of meetings between a number of clubs at preset dates under preset rules. Such a problem can be divided in two subproblems: firstly developing a Home-Away schedule with oriented edge-colourings of complete graphs and secondly assigning the clubs to the Home-Away patterns with a clustering algorithm. Theoretical and real world aspects will be demonstrated by the construction of the Dutch Professional Football (US: soccer) Leagues.