Minimum chromaticity of circulant graphs Original Research Article

We determine families of circulant graphs for which each graph image has chromatic number image. In particular, we show that there exists an image such that image for all image whenever image and image and image or image and image and image. We also prove that image for every recursive circulant graph image, image, image.