Journal article
The chromatic number of 5-valent circulants
Abstract
A circulant C(n;S) with connection set S={a1,a2,…,am} is the graph with vertex set Zn, the cyclic group of order n, and edge set E={{i,j}:|i−j|∈S}. The chromatic number of connected circulants of degree at most four has been previously determined completely by Heuberger [C. Heuberger, On planarity and colorability of circulant graphs, Discrete Math. 268 (2003) 153–169]. In this paper, we determine completely the chromatic number of connected …
Authors
Meszka M; Nedela R; Rosa A
Journal
Discrete Mathematics, Vol. 308, No. 24, pp. 6269–6284
Publisher
Elsevier
Publication Date
12 2008
DOI
10.1016/j.disc.2007.11.065
ISSN
0012-365X