Circular Coloring the Plane
暂无分享,去创建一个
The unit distance graph $\mathcal{R}$ is the graph with vertex set $\mathbb{R}^2$ in which two vertices (points in the plane) are adjacent if and only if they are at Euclidean distance $1$. We prove that the circular chromatic number of $\mathcal{R}$ is at least $4$, thus improving the known lower bound of $32/9$ obtained from the fractional chromatic number of $\mathcal{R}$.
[1] E. Scheinerman,et al. Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .
[2] Xuding Zhu,et al. Circular chromatic number: a survey , 2001, Discret. Math..
[3] V. Klee,et al. Combinatorial Geometry in the Plane , 1964 .