Vertex-Colouring of Some 3-Chromatic Circulant Graphs Cn(A, B, C) with Gcd(N, a) Mod 3 = 0
Reference32 articles.
1. Research Problem 2-10;A �d�m;J. Combinatorial Theory,1967
2. Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs;B Codenotti;Linear Algebra and its Applications,1998
3. On Planarity and Colorability of Circulant Graphs;C Heuberger;Discrete Math,2003
4. Five-coloring maps on surfaces;C Thomassen;J. Combin. Theory Ser. B,1993