Article ID Journal Published Year Pages File Type
4649466 Discrete Mathematics 2009 10 Pages PDF
Abstract

Given a set DD of a cyclic group CC, we study the chromatic number of the circulant graph G(C,D)G(C,D) whose vertex set is CC, and there is an edge ijij whenever i−j∈D∪−Di−j∈D∪−D. For a fixed set D={a,b,c:a

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the chromatic number of circulant graphs
Authors
, ,