Chromatic properties of the Euclidean plane

James D. Currie, Roger B. Eggleton

Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le χ(G)\le 7…