 About 26,000 results
 The Graphing & Statistical Standard Download Free SigmaPlot 13 Demo
 books.google.com X C Rn. A famous problem on unitdistance graph (see [13,35]) is to ask the
chromatic number x(/?2(l)) of the unitdistance ... Eggleton, Erdos, Skilton [15,16,
17] studied primedistance graphs in which the distance set is the set P of the
prime ... 

 books.google.com PRIME DISTANCE GRAPHS For any D g 'P, where 'P denotes the set of all
primes, let Z(D) denote the graph with the integers as vertex set and with an edge
joining i and j if and only if Ii — j] E D. Which sets D satisfy X(Z(D)) = 4? I Eggleton
... 

 books.google.com The prime zeta function can be expressed in terms of the RIEMANN ZETA
FUNCTION by ln z(n)0( X ln1(p(nð Þ0 X p]2 X k01 p(knk p]2 0 X k01 ... Prime
Distance Graph A DISTANCE GRAPH with distance set given by the set of prime
numbers. 

 books.google.com Ddistance graph Given a set D of positive numbers containing 1 and a metric
space . ... if D D .0; 1, an integraldistance graph if D D ZC, a rationaldistance
graph if D D QC, and a primedistance graph if D is the set of prime numbers (
with 1). 

 books.google.com I. Tomescu; Maximal chromatic polynomials of connected planar graphs, J .
Graph Theory, 14, 101110 (1990). ... Eggleton; New results on 3chromatic
prime distance graphs, Ars Combirtatoria, Series B, 26, 153180 (1988). J. Beck;
On ... 

 books.google.com [2] Eggleton, R. B.; Erdiis, P.; Skilton, D. K.; Colouring prime distance graphs.
Graphs Combin. 6 (1990), no. 1, 17—32. [3] Falconer, K. J.; The realization of
distances in measurable subsets covering R". J. Combin. Theory Ser. A 31 (1981
), no. 

 books.google.com 1990.06 1990.07 1990.08 1990.09 1990.10 1990.11 1990.12 1990.13 1990.14
1990.15 1990.16 1990.17 Colouring prime distance graphs, Graphs Combin. 6 (
1990) no. 1, 17–32 (R. B. Eggleton; D. K. Skilton); MR 91f:05052; Zbl. 698.05033. 

 books.google.com M. Truszczynski, Z. Tuza, Rado's Selection Principle: applications to binary
relations, graph and hypergraph colorings and partially ordered sets, Discrete
Math. 109 (1992), 301312. M. Voigt, H. Walther, Chromatic number of prime
distance ... 

 books.google.com distance d; for this, one has to allow a residual 'splitprime' term in the
decomposition. We present here the ... edge weights w. Recall that d can be
decomposed as d = 53e€E wef>(Se) where Se, V \ Se denote the two
components of the graph ... 

 books.google.com 
 