Regular chromatic number and the lonely runner problem (Q3503506): Difference between revisions

@@ Property / author @@
-Javier Barajas
@@ Property / author: Javier Barajas / rank @@
-Normal rank
@@ Property / author @@
+Javier Barajas
@@ Property / author: Javier Barajas / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2007.07.085
+Normal rank
@@ Property / OpenAlex ID @@
+W2011091730
@@ Property / OpenAlex ID: W2011091730 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576683
@@ Property / cites work: Q3576683 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of circulant graphs
@@ Property / cites work: On the chromatic number of circulant graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Untere Schranken für zwei diophantische Approximations-Funktionen
+Normal rank
@@ Property / cites work @@
+Flows, view obstructions, and the lonely runner
@@ Property / cites work: Flows, view obstructions, and the lonely runner / rank @@
+Normal rank
@@ Property / cites work @@
+Six lonely runners
@@ Property / cites work: Six lonely runners / rank @@
+Normal rank
@@ Property / cites work @@
+View-obstruction problems
@@ Property / cites work: View-obstruction problems / rank @@
+Normal rank
@@ Property / cites work @@
+View-obstruction problems in \(n\)-dimensional geometry
+Normal rank
@@ Property / cites work @@
+View-Obstruction Problems. II
@@ Property / cites work: View-Obstruction Problems. II / rank @@
+Normal rank
@@ Property / cites work @@
+View-obstruction problems. III
@@ Property / cites work: View-obstruction problems. III / rank @@
+Normal rank
@@ Property / cites work @@
+View-obstruction: a shorter proof for 6 lonely runners
+Normal rank
@@ Property / cites work @@
+Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
+Normal rank
@@ Property / cites work @@
+Circular chromatic number of distance graphs with distance sets of cardinality 3
+Normal rank