A spectral technique to solve the chromatic number problem in circulant graphs

Abstract

The computation of the CHROMATIC NUMBER of circulant graph is essentially hard as in the general case. However in this case it is possible to use spectral properties of the graph to obtain a good coloration. In this paper we use these properties to construct two heuristic algorithms to color a circulant graph. In the case of sparse graphs, we show that our heuristic algorithms give results better than the classical ones. © Springer-Verlag Berlin Heidelberg 2004.