Abstract
In this paper we consider a circular version of the Nelson-Hadwiger problem. Namely, we show a circular (4+433)-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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
