Abstract
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 whenever $|x-y| \in D$. The chromatic number, circular chromatic number and fractional chromatic number of distance graphs have been studied extensively in the past two decades; these coloring parameters are also closely related to some problems studied in number theory and geometry. We survey some research advances and open problems on coloring parameters of distance graphs.
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.
