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