AbstractGiven 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
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
AbstractThis paper studies circular chromatic numbers and fractional chromatic numbers of distance g...
AbstractGiven positive integers m, k, s withm&sk, let Dm, k, srepresent the set {1, 2,⋯ , m } \ { k,...
AbstractSuppose m,k,s are positive integers with m>sk. Let Dm,k,s denote the set {1,2,…,m}⧹{k,2k,…,s...
AbstractGiven positive integers m, k, s withm&sk, let Dm, k, srepresent the set {1, 2,⋯ , m } \ { k,...
AbstractSuppose m,k,s are positive integers with m>sk. Let Dm,k,s denote the set {1,2,…,m}⧹{k,2k,…,s...
AbstractLet D be a set of positive integers. The distance graph G(Z,D) with distance set D is the gr...
AbstractThis paper studies circular chromatic numbers and fractional chromatic numbers of distance g...
Let M be a set of positive integers. The distance graph generated by M, denoted by G(Z,M), has the s...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
AbstractWe discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chroma...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
Abstract: Suppose D is a subset of all positive integers. The distance graph G(Z;D) with distance se...
AbstractLet D be a set of positive integers. The distance graph generated by D, denoted by G(Z,D), h...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
AbstractThis paper studies circular chromatic numbers and fractional chromatic numbers of distance g...
AbstractGiven positive integers m, k, s withm&sk, let Dm, k, srepresent the set {1, 2,⋯ , m } \ { k,...
AbstractSuppose m,k,s are positive integers with m>sk. Let Dm,k,s denote the set {1,2,…,m}⧹{k,2k,…,s...
AbstractGiven positive integers m, k, s withm&sk, let Dm, k, srepresent the set {1, 2,⋯ , m } \ { k,...
AbstractSuppose m,k,s are positive integers with m>sk. Let Dm,k,s denote the set {1,2,…,m}⧹{k,2k,…,s...
AbstractLet D be a set of positive integers. The distance graph G(Z,D) with distance set D is the gr...
AbstractThis paper studies circular chromatic numbers and fractional chromatic numbers of distance g...
Let M be a set of positive integers. The distance graph generated by M, denoted by G(Z,M), has the s...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
AbstractWe discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chroma...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
Abstract: Suppose D is a subset of all positive integers. The distance graph G(Z;D) with distance se...
AbstractLet D be a set of positive integers. The distance graph generated by D, denoted by G(Z,D), h...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
AbstractThis paper studies circular chromatic numbers and fractional chromatic numbers of distance g...
AbstractGiven positive integers m, k, s withm&sk, let Dm, k, srepresent the set {1, 2,⋯ , m } \ { k,...
DOI
Add to ORKG