On the chromatic number of circulant graphs

2008/06/03 by Javier Barajas, Oriol Serra · 16 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Circulant graph #Circulant matrix #Combinatorics #Computer science #Discrete mathematics #Friendship graph #Graph #Graph Labeling and Dimension Problems #Graph power #Limits and Structures in Graph Theory #Line graph #Mathematics #Set (abstract data type) #Vertex (graph theory)

paper · doi:10.1016/j.disc.2008.04.041

published in Discrete Mathematics 309(18), 5687-5696 (Elsevier BV)

openalex publication_date 2008/06/03 · crossref created 2008/06/03 · crossref issued 2009/09/01 · crossref published 2009/09/01 · crossref published-print 2009/09/01 · crossref deposited 2020/05/06 · crossref indexed 2025/09/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/21

Citations

• Flows, View Obstructions, and the Lonely Runner
• View-obstruction problems, III
• View-obstruction problems
• The View-Obstruction Problem forn-Dimensional Cubes
• Untere Schranken f�r zwei diophantische Approximations-Funktionen
• View-obstruction problems in n-dimensional geometry
• View-obstruction: a shorter proof for 6 lonely runners
• Zwei S�tze �ber inhomogene diophantische Approximation von Irrationalzehlen

Cited by

• The lonely runner problem for lacunary sequences
• The Lonely Runner with Seven Runners
• The lonely runner problem for many runners
• Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
• Lonely runner conjecture [wikipedia]