Add to ORKGLet M be a set of positive integers. The distance graph generated by M, denoted by G(Z,M), has the set Z of all integers as the verte
Abstract: Suppose D is a subset of all positive integers. The distance graph G(Z;D) with distance se...
Let $D$ be a finite set of integers. The distance graph $G(D)$ has the set of integers as vertices a...
AbstractWe discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chroma...
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z,D), has the s...
AbstractThis paper studies circular chromatic numbers and fractional chromatic numbers of distance g...
AbstractLet D be a set of positive integers. The distance graph G(Z,D) with distance set D is the gr...
AbstractWe discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chroma...
AbstractGiven a set D of positive integers, the distance graph G(Z,D) has vertices all integers Z, a...
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 generated by D, denoted by G(Z,D), h...
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...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
Abstract: Suppose D is a subset of all positive integers. The distance graph G(Z;D) with distance se...
Let $D$ be a finite set of integers. The distance graph $G(D)$ has the set of integers as vertices a...
AbstractWe discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chroma...
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z,D), has the s...
AbstractThis paper studies circular chromatic numbers and fractional chromatic numbers of distance g...
AbstractLet D be a set of positive integers. The distance graph G(Z,D) with distance set D is the gr...
AbstractWe discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chroma...
AbstractGiven a set D of positive integers, the distance graph G(Z,D) has vertices all integers Z, a...
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 generated by D, denoted by G(Z,D), h...
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...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
Abstract: Suppose D is a subset of all positive integers. The distance graph G(Z;D) with distance se...
Let $D$ be a finite set of integers. The distance graph $G(D)$ has the set of integers as vertices a...
AbstractWe discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chroma...