Minimum chromaticity of circulant graphs

DOI10.1016/j.disc.2004.03.020zbMath1081.05037OpenAlexW2067133893MaRDI QIDQ2568490

Goran Ružić, Joseph G. Peters, Nenad Obradović

Publication date: 10 October 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.03.020

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ Vertex-colouring of 3-chromatic circulant graphs ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ On the chromatic number of circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Colouring prime distance graphs
• Hamiltonian decomposition of Cayley graphs of degree 4
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• On the chromatic number of special distance graphs
• The chromatic numbers of distance graphs
• Coloring of integer distance graphs
• On the spectral Ádám property for circulant graphs
• Cyclic graphs
• NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS
• Circulants and their connectivities
• Recognizing circulant graphs in polynomial time: An application of association schemes

This page was built for publication: Minimum chromaticity of circulant graphs