Coloring of distance graphs with intervals as distance sets

@article{Lam2005ColoringOD,
  title={Coloring of distance graphs with intervals as distance sets},
  author={Peter Che Bor Lam and Wensong Lin},
  journal={Eur. J. Comb.},
  year={2005},
  volume={26},
  pages={1216-1229}
}
Let D be a set of positive integers. The distance graph G(Z , D) with distance setD is the graph with vertex setZ in which two verticesx, y are adjacent if and only if |x − y| ∈ D. The fractional chromatic number, the chromatic number, and the circular chromatic number of G(Z , D) for various D have been extensively studied recently. In this paper, we investigate the fractional chromatic number, the chromatic number, and the circular chromatic number of the distance graphs with the distance… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…