| Автор | Beecham, A. F. |
| Автор | Hurley, A. C. |
| Дата выпуска | 1980 |
| dc.description | AbstractIt is shown that a problem which arose in the scheduling of two simultaneous competitions between a number of golf clubs may be reduced to that of 4- colouring the edges of a certain bipartite graph which has 4 edges meeting at each vertex. This colouring problem is solved by an analysis in terms of directed cycles, which is simple to carry through in a practical case and is easily extended to the problem with 4 replaced by 2<sup>m</sup>. The more general colouring problem with 4 replaced by any positive integer is solved by relating it to the marriage problem enunciated by Philip Hall and to the latin multiplication technique of Kaufmann but, in practical applications, this approach involves severe computational difficulties. |
| Формат | application.pdf |
| Издатель | Cambridge University Press |
| Копирайт | Copyright © Australian Mathematical Society 1980 |
| Название | A scheduling problem with a simple graphical solution |
| Тип | research-article |
| DOI | 10.1017/S0334270000002174 |
| Electronic ISSN | 1446-8735 |
| Print ISSN | 0334-2700 |
| Журнал | The Journal of the Australian Mathematical Society. Series B. Applied Mathematics |
| Том | 21 |
| Первая страница | 486 |
| Последняя страница | 495 |
| Аффилиация | Beecham A. F.; CSIRO Division of Chemical Physics, P.O. Box 160, Clayton, Victoria 3168 |
| Аффилиация | Hurley A. C.; CSIRO Division of Chemical Physics, P.O. Box 160, Clayton, Victoria 3168 |
| Выпуск | 4 |
