Skip Navigation

The Computer Journal 1969 12(4):317-319; doi:10.1093/comjnl/12.4.317
© 1969 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 (30)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wood, D. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A technique for colouring a graph applicable to large scale timetabling problems

D. C. Wood *

Mitre Corporation, McLean, Virginia, USA

The connection is explained between scheduling problems and colouring the vertices of a graph such that no two adjacent vertices are the same colour, and the minimum number of colours are used. A method of colouring a graph suitable for large scale timetabling problems is described.

Received November 1968.

* Department of Applied Mathematics and Computer Science, University of Virginia, Charlottesville, Virginia 22903, U.S.A.

§ Present address: Mitre Corporation, McLean, Virginia 22101, U.S.A.


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.