AbstractFor all l ⩾ 10 and u ⩾ l2 − 6l + 3 the chromatic number is proved to be 3 for distance graphs with all integers as vertices, and edges only if the vertices are at distances 2, 3, u, and u + l
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractFor all l ⩾ 10 and u ⩾ l2 − 6l + 3 the chromatic number is proved to be 3 for distance graph...
AbstractFor any set D of positive integers, the distance graph G(D)G(V,E) is the graph with vertex ...
AbstractLet D be a subset of the set P of prime numbers not containing any twin primes. Kemnitz and ...
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...
AbstractThe distance graph G(D) has the set of integers as vertices and two vertices are adjacent in...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
AbstractFor any set D of positive integers, the distance graph G(D)G(V,E) is the graph with vertex ...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
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,...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractFor all l ⩾ 10 and u ⩾ l2 − 6l + 3 the chromatic number is proved to be 3 for distance graph...
AbstractFor any set D of positive integers, the distance graph G(D)G(V,E) is the graph with vertex ...
AbstractLet D be a subset of the set P of prime numbers not containing any twin primes. Kemnitz and ...
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...
AbstractThe distance graph G(D) has the set of integers as vertices and two vertices are adjacent in...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
AbstractFor any set D of positive integers, the distance graph G(D)G(V,E) is the graph with vertex ...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
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,...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractAn integer distance graph is a graph G(D) with the set of integers as vertex set and with an...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
DOI
Add to ORKG