An algorithm for obtaining the chromatic number and an optimal coloring of a graph
References (9)
The theory of graphs
(1962)Graph theory
(1969)- C. Bron and J. Kerbosch, Finding all cliques of an undirected graph, private...
Algorithms for finding cliques of a graph
There are more references available in the full text version of this article.
Cited by (2)
Efficient bounds on a branch and bound algorithm for graph colouration
1991, International Journal of Mathematical Education in Science and TechnologyFrequency Assignment: Theory and Applications
1980, Proceedings of the IEEE
Copyright © 1973 Published by Elsevier B.V.