Skip Navigation

The Computer Journal 1967 10(1):85-86; doi:10.1093/comjnl/10.1.85
© 1967 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (95)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Welsh, D. J. A.
Right arrow Articles by Powell, M. B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An upper bound for the chromatic number of a graph and its application to timetabling problems

D. J. A. Welsh and M. B. Powell *

Mathematical Institute, Oxford, UK

This paper points out the connection between the basic scheduling or timetabling problem with the well known problem of colouring the vertices of a graph in such a way that (i) no two adjacent vertices are the same colour and (ii) the number of colours used is a minimum. We give an algorithm for colouring a graph subject to (i) and give a new easily determined bound for the number of colours needed. This same bound is also a new upper bound for the chromatic number of a graph in terms of the degrees of its vertices.


* Mathematical Institute, Oxford.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 JOURNAL OF EDUCATIONAL AND BEHAVIORAL STATISTICSHome page
L. J. Hubert and F. B. Baker
Identifying a Migration Effect in Complete-Link Hierarchical Clustering
Journal of Educational and Behavioral Statistics, January 1, 1979; 4(1): 74 - 92.
[Abstract] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.