Vertex-colouring of 3-chromatic circulant graphs

DOI10.1016/j.dam.2017.05.013zbMath1367.05079OpenAlexW2731804756MaRDI QIDQ2012064

Sara Nicoloso, Ugo Pietropaoli

Publication date: 27 July 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2017.05.013

zbMATH Keywords

chromatic numbercirculant graphsvertex-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Coloring Toeplitz graphs ⋮ Dense bipartite circulants and their routing via rectangular twisted torus ⋮ Chromatic numbers of Cayley graphs of abelian groups: a matrix method ⋮ Bipartite finite Toeplitz graphs ⋮ On the chromatic number of Toeplitz graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of discrete planes
• Colouring the real line
• The chromatic number of 5-valent circulants
• On the chromatic number of circulant graphs
• Hamiltonian decomposition of Cayley graphs of degree 4
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• Five-coloring maps on surfaces
• On planarity and colorability of circulant graphs
• 4-colorable 6-regular toroidal graphs.
• Cyclic graphs
• Algorithmic and explicit determination of the Lovász number for certain circulant graphs
• Minimum chromaticity of circulant graphs
• Circulants and their connectivities
• Clique, chromatic, and Lovász numbers of certain circulant graphs
• Computing the Diameter in Multiple-Loop Networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• On Six-Chromatic Toroidal Graphs
• Integral distance graphs
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Reducibility among Combinatorial Problems
• ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
• Graph-Theoretic Concepts in Computer Science
• Computational Science and Its Applications – ICCSA 2004