On the Nelson unit distance coloring problem

American Mathematical Monthly

Volumn 106, Issue 9, 1999, Pages 850-853

  Thomassen, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033242695     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2589618     Document Type: Article

References (6)

1. N. G. de Bruijn and P. Erdos, A colour problem for infinite graphs and a problem in the theory of relations. Nederl. Akad. Wetensch. Proc. Ser. A 54 (Indag. Math. 13 (1951) 371-373).
2. N. G. de Bruijn and P. Erdos, A colour problem for infinite graphs and a problem in the theory of relations. Nederl. Akad. Wetensch. Proc. Ser. A 54 (Indag. Math. 13 (1951) 371-373).
3. T. Jensen and B. Toft, Graph Coloring Problems, J. Wiley, New York, 1995.
4. A. Soifer, Chromatic number of the plane: a historical essay. Geombinatorics I (3) (1991) 13-15.
5. S. P. Townsend, Every 5-coloured map in the plane contains a monochrome unit, J. Combinatorial Ser, A 30 (1981) 114-115.
6. D. R. Woodall, Distances realized by sets covering the plane, J. Combinatorial Theory Ser. A 14 (1973) 187-200.