| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513553 | Discrete Mathematics | 2005 | 12 Pages |
Abstract
Given a set D of positive integers, the distance graph G(Z,D) has vertices all integers Z, and two vertices j and jâ² in Z are adjacent if and only if |j-jâ²|âD. This paper determines the circular chromatic numbers of some distance graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Wensong Lin, Peter Che Bor Lam, Zengmin Song,