On the chromatic number of circulant graphs
From MaRDI portal
Publication:1045059
DOI10.1016/j.disc.2008.04.041zbMath1213.05064OpenAlexW2137652538MaRDI QIDQ1045059
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.041
Related Items (14)
Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ Chromatic number of Harary graphs ⋮ Perfect 1-Factorizations of a Family of Cayley Graphs ⋮ On the time for a runner to get lonely ⋮ On the chromatic number of integral circulant graphs ⋮ Regular chromatic number and the lonely runner problem ⋮ The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ ⋮ Chromatic numbers of Cayley graphs of abelian groups: a matrix method ⋮ The lonely runner problem for lacunary sequences ⋮ Some remarks on the lonely runner conjecture ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ Vertex-colouring of 3-chromatic circulant graphs ⋮ Lonely Runner Polyhedra ⋮ Computing the covering radius of a polytope with an application to lonely runners
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring the real line
- On a conjecture in diophantine approximations. III
- Colouring prime distance graphs
- The lonely runner with seven runners
- View-obstruction problems. III
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- Pattern periodic coloring of distance graphs
- On a conjecture in diophantine approximations. IV
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- The view-obstruction problem for \(n\)-dimensional cubes
- The chromatic numbers of distance graphs
- Flows, view obstructions, and the lonely runner
- On planarity and colorability of circulant graphs
- 4-colorable 6-regular toroidal graphs.
- Circular chromatic numbers of some distance graphs
- Distance graphs with finite chromatic number
- View-obstruction: a shorter proof for 6 lonely runners
- View-obstruction problems in \(n\)-dimensional geometry
- Distance graphs with maximum chromatic number
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Untere Schranken für zwei diophantische Approximations-Funktionen
- View-obstruction problems
- Minimum chromaticity of circulant graphs
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- View-Obstruction Problems. II
- Integral distance graphs
- Distance Graphs on the Integers
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Chromatic numbers of integer distance graphs
- Six lonely runners
- Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence
This page was built for publication: On the chromatic number of circulant graphs
