Name
Abstract | ||
|---|---|---|
The problem of colouring the real line so that the distance between like coloured numbers does not lie in some specified set D, called the distance set, is discussed. In particular, the minimum number of colours needed for various distance sets are determined. |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1016/0095-8956(85)90039-5 | Journal of Combinatorial Theory, Series B |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Real line,Mathematics | Journal | 39 |
Issue | ISSN | Citations |
1 | 0095-8956 | 52 |
PageRank | References | Authors |
5.56 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R.B Eggleton | 1 | 53 | 6.18 |
| P Erdös | 2 | 626 | 190.85 |
| D.K Skilton | 3 | 52 | 5.56 |