Geodesic
On a problem of colouring the real plane
Mathematica Bohemica, Tome 116 (1991) no. 3, pp. 309-318

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
What is the least number of colours which can be used to colour all points of the real Euclidean plane so that no two points which are unit distance apart have the same colour? This well known problem, open more than 25 years is studied in the paper. Some partial results and open subproblems are presented.
What is the least number of colours which can be used to colour all points of the real Euclidean plane so that no two points which are unit distance apart have the same colour? This well known problem, open more than 25 years is studied in the paper. Some partial results and open subproblems are presented.
DOI : 10.21136/MB.1991.126170
Classification : 05C15
Keywords: vertex colouring; infinity graph; decomposition of the real plane 
Guldan, Filip. On a problem of colouring the real plane. Mathematica Bohemica, Tome 116 (1991) no. 3, pp. 309-318. doi: 10.21136/MB.1991.126170
@article{10_21136_MB_1991_126170,
     author = {Guldan, Filip},
     title = {On a problem of colouring the real plane},
     journal = {Mathematica Bohemica},
     pages = {309--318},
     year = {1991},
     volume = {116},
     number = {3},
     doi = {10.21136/MB.1991.126170},
     mrnumber = {1126452},
     zbl = {0758.05052},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1991.126170/}
}
TY  - JOUR
AU  - Guldan, Filip
TI  - On a problem of colouring the real plane
JO  - Mathematica Bohemica
PY  - 1991
SP  - 309
EP  - 318
VL  - 116
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.1991.126170/
DO  - 10.21136/MB.1991.126170
LA  - en
ID  - 10_21136_MB_1991_126170
ER  - 
%0 Journal Article
%A Guldan, Filip
%T On a problem of colouring the real plane
%J Mathematica Bohemica
%D 1991
%P 309-318
%V 116
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.1991.126170/
%R 10.21136/MB.1991.126170
%G en
%F 10_21136_MB_1991_126170

[1] R. B. Eggleton P. Erdös D. K. Skilton: Colouring the real line. J. Comb. Theory Ser. B 39 (1985), 86-100. | DOI | MR

[2] P. Erdös: Some unsolved problems. Publ. Math. Inst Hung. Acad. Sci. 6 (1961), 221-254. | MR

[3] P. Erdös F. Harary W. T. Tutte: On dimension of a graph. Mathematika 12 (1965), 118-122. | DOI | MR

[4] P. Erdös: On combinatorial problems which I would most like to see solved. Combinatorica 1 (1981), 25-42. | DOI | MR

[5] P. Frankl: Extremal problems and coverings of the space. European J. Comb. I (1980), 101-106. | DOI | MR | Zbl

[6] H. Hadwiger: Ungelöste Probleme No. 40. Elemente der Math. 16 (1961), 103-104. | MR

[7] H. Hadwiger H. Debrunner V. Klee: Combinatorial Geometry in the Plane. Holt, Reinehart and Winston, New York (1964). | MR

[8] D. G. Larman C. A. Rogers: The realization of distances within sets in Euclidean space. Mathematika 19 (1972), 1-24. | DOI | MR

[9J L. Moser W. Moser: Solution to Problem 10. Canad. Math. Bull. 4 (1961), 187-189. | DOI

[10] N. Wormald: A 4-chromatic graph with a special plane drawing. J. Austral. Math. Soc. Ser. A 28 (1979), 1-8. | MR | Zbl

Cité par Sources :