First non-trivial upper bound on circular chromatic number of the plane

In this paper we consider a circular version of the Nelson-Hadwiger problem. Namely, we show a circular -coloring of the unit distance graph, which is a graph with the set of all points of the plane as the vertex set and any two points adjacent if their euclidean distance is equal to one.