Regular chromatic number and the lonely runner problem

DOI10.1016/j.endm.2007.07.085zbMath1215.05052OpenAlexW2011091730MaRDI QIDQ3503506

Oriol Serra, Javier Barajas

Publication date: 5 June 2008

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

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.085

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Inequalities and extremum problems involving convexity in convex geometry (52A40) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Invisible runners in finite fields

Cites Work

• Unnamed Item
• On the chromatic number of circulant graphs
• View-obstruction problems. III
• Flows, view obstructions, and the lonely runner
• View-obstruction: a shorter proof for 6 lonely runners
• View-obstruction problems in \(n\)-dimensional geometry
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• Untere Schranken für zwei diophantische Approximations-Funktionen
• View-obstruction problems
• View-Obstruction Problems. II
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Six lonely runners

This page was built for publication: Regular chromatic number and the lonely runner problem