DOIAbstract
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
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
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...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
AbstractFor all l ⩾ 10 and u ⩾ l2 − 6l + 3 the chromatic number is proved to be 3 for distance graph...
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...
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...
Abstract: Suppose D is a subset of all positive integers. The distance graph G(Z;D) with distance se...
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...
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...
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...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
AbstractFor all l ⩾ 10 and u ⩾ l2 − 6l + 3 the chromatic number is proved to be 3 for distance graph...
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...
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...
Abstract: Suppose D is a subset of all positive integers. The distance graph G(Z;D) with distance se...
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...
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...
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...
We give some necessary conditions for a graph to be 3-chromatic in terms of the spectrum of the adja...
Add to ORKG