Skip Navigation

The Computer Journal 1981 24(1):85-86; doi:10.1093/comjnl/24.1.85
© 1981 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 (13)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dutton, R. D.
Right arrow Articles by Brigham, R. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A new graph colouring algorithm

R. D. Dutton1 * and R. C. Brigham2 §

1 Department of Computer Science, University of Central Florida, Orlando, USA, 2 Department of Mathematics and Statistics, University of Central Florida, Orlando, USA

Many heuristics polynomial time algorithms exist to colour the vertices of connected undirected graphs having no loops or multiple edges. Associated with each such algorithm are graphs for which the number of colours required in the colouring produced by the algorithm is significantly greater than the minimum that are necessary. Thus it is desirable to have available a range of such algorithms. One, based on a theorem of Zykov, is described here. It has performed well on most graphs to which it has been applied, including some on which other algorithms fail. However it has its own ‘bad’ graphs, and one such family is listed.

Received June 1979.

* Department of Computer Science, University of Central Florida, Orlando, Florida 32816, USA.

§ Department of Mathematics and Statistics, University of Central Florida, Orlando.


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




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.