On the chromatic number of circulant graphs
type: Item
instance of: scholarly article
title: On the chromatic number of circulant graphs
zbMATH Open document ID: 1213.05064
author: Javier Barajas
author: Oriol Serra
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5648106
zbMATH Keywords: circulant graphs
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
full work available at URL: j.disc.2008.04.041
OpenAlex ID: W2137652538
cites work: Sidon sets in groups and induced subgraphs of Cayley graphs
cites work: Distance graphs with maximum chromatic number
cites work: The lonely runner with seven runners
cites work: Untere Schranken für zwei diophantische Approximations-Funktionen
cites work: Flows, view obstructions, and the lonely runner
cites work: Six lonely runners
cites work: Circular chromatic numbers and fractional chromatic numbers of distance graphs
cites work: On a conjecture in diophantine approximations. III
cites work: On a conjecture in diophantine approximations. IV
cites work: Integral distance graphs
cites work: The view-obstruction problem for \(n\)-dimensional cubes
cites work: Hardness results and spectral techniques for combinatorial problems on circulant graphs
cites work: View-obstruction problems. III
cites work: View-obstruction problems
cites work: View-obstruction problems in \(n\)-dimensional geometry
cites work: View-Obstruction Problems. II
cites work: The chromatic numbers of distance graphs
cites work: Colouring the real line
cites work: Colouring prime distance graphs
cites work: Distance Graphs on the Integers
cites work: On planarity and colorability of circulant graphs
cites work: Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence
cites work: Q4329050
cites work: Chromatic numbers of integer distance graphs
cites work: Circular chromatic numbers of some distance graphs
cites work: Fractional chromatic number and circular chromatic number for distance graphs with large clique size
cites work: Q4238040
cites work: Q3410615
cites work: Minimum chromaticity of circulant graphs
cites work: View-obstruction: a shorter proof for 6 lonely runners
cites work: Distance graphs with finite chromatic number
cites work: Colouring of distance graphs
cites work: Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
cites work: 4-colorable 6-regular toroidal graphs.
cites work: Circular chromatic number of distance graphs with distance sets of cardinality 3
cites work: Pattern periodic coloring of distance graphs
DOI: 10.1016/J.DISC.2008.04.041
Recommended article: On the chromatic number of integral circulant graphs
Recommended article: On the set of circular total chromatic numbers of graphs
Recommended article: Circular total chromatic numbers of graphs
Recommended article: Q4677966
Recommended article: Q5320274
Recommended article: Q4545983
Recommended article: On the circular chromatic number of graph powers
Recommended article: On the circular chromatic number of circular partitionable graphs
Recommended article: Q4736226
Recommended article: The circular chromatic number of hypergraphs
description: scientific article; zbMATH DE number 5648106