Name
Abstract | ||
|---|---|---|
Four colours are necessary and sufficient to colour all the integers so that any two with difference equal to a prime have different colours. We investigate the corresponding problem when the setD of prescribed differences is a proper subset of the primes. In particular, we prove that ifD contains {2, 3} and also contains a pair of twin primes (one of which may be 3), then four colours are necessary. Numerous results regarding periodic colourings are also obtained. However, the problem of characterizing those setsD which necessitate four colours remains open. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/BF01787476 | GRAPHS AND COMBINATORICS |
Field | DocType | Volume |
Prime (order theory),Integer,Graph,Combinatorics,Twin prime,Periodic graph (geometry),Mathematics | Journal | 6 |
Issue | ISSN | Citations |
1 | 0911-0119 | 22 |
PageRank | References | Authors |
2.17 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. B. Eggleton | 1 | 22 | 2.50 |
| P Erdös | 2 | 626 | 190.85 |
| D. K. Skilton | 3 | 22 | 2.17 |