
This paper studies the circular (or star) chromatic numbers and fractional chromatic numbers of distance graphs \(G(Z, D)\) for various sets \(D\) (being the graph with vertex set a subset of the integers, and two vertices \(x\), \(y\) being adjacent iff \(| x-y|\in D\)). Various specific cases are calculated, including all cases when \(| D|= 2\).
Coloring of graphs and hypergraphs, Distance in graphs, chromatic numbers, Computational Theory and Mathematics, fractional, Geometry and Topology, distance graphs, circular, Theoretical Computer Science
Coloring of graphs and hypergraphs, Distance in graphs, chromatic numbers, Computational Theory and Mathematics, fractional, Geometry and Topology, distance graphs, circular, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 32 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
