Skip Navigation

The Computer Journal 1976 19(4):329-332; doi:10.1093/comjnl/19.4.329
© 1976 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 (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sakaki, T.
Right arrow Articles by Hattori, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Algorithms for finding in the lump both bounds of the chromatic number of a graph*

T. Sakaki1 §, K. Nakashima2 ¶ and Y. Hattori3 {ddagger}

1 Hankyu Corporation, Japan, 2 Department of Electronics, Himeji Institute of Technology, Japan, 3 Institute of Atomic Energy, Kyoto University, Kyoto, Japan

Many problems of scheduling or timetabling are reduced to finding the chromatic number of a graph, i.e. the minimum number of colours assigned to vertices so that no two adjacent vertices have the same colour. In this paper algorithms for finding in the lump a lower bound and an upper bound of the chromatic number are given. The results obtained for several graphs by the computer are indicated and compared with other methods.

Received September 1974.

* This work was performed at the Insitute of Atomic Energy, Kyoto University, Uji Kyoto-Fu 611, Japan.

§ Hankyu Corporation, Japan.

Department of Electronics, Himeji Institute of Technology, Japan.

{ddagger} Institute of Atomic Energy, Kyoto University, Japan.


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.