FROM RAINBOW TO THE LONELY RUNNER: A SURVEY ON COLORING PARAMETERS OF DISTANCE GRAPHS
FROM RAINBOW TO THE LONELY RUNNER: A SURVEY ON COLORING PARAMETERS OF DISTANCE GRAPHS
Motivated by the plane coloring problem, Eggleton, Erd\H{o}s and Skelton initiated the study of distance graphs. Let $D$ be a set of positive integers. The distance graph generated by $D$, denoted by $G(\mathbb{Z}, D)$, has all integers $\mathbb{Z}$ as the vertex set, and two vertices $x$ and $y$ are adjacent …