On the possibility of applying a computer when solving the four color problem
Applications of Mathematics, Tome 16 (1971) no. 2, pp. 83-97.

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

The present paper introduces an algorithm which enables one to ascertain for any positive integer $n>4$ whether every map consisting of $n$ countries may be regularly stained by at most four colours.
DOI : 10.21136/AM.1971.103333
Classification : 05C15
@article{10_21136_AM_1971_103333,
     author = {Gruber, Boris},
     title = {On the possibility of applying a computer when solving the four color problem},
     journal = {Applications of Mathematics},
     pages = {83--97},
     publisher = {mathdoc},
     volume = {16},
     number = {2},
     year = {1971},
     doi = {10.21136/AM.1971.103333},
     mrnumber = {0281655},
     zbl = {0218.05055},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1971.103333/}
}
TY  - JOUR
AU  - Gruber, Boris
TI  - On the possibility of applying a computer when solving the four color problem
JO  - Applications of Mathematics
PY  - 1971
SP  - 83
EP  - 97
VL  - 16
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1971.103333/
DO  - 10.21136/AM.1971.103333
LA  - en
ID  - 10_21136_AM_1971_103333
ER  - 
%0 Journal Article
%A Gruber, Boris
%T On the possibility of applying a computer when solving the four color problem
%J Applications of Mathematics
%D 1971
%P 83-97
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1971.103333/
%R 10.21136/AM.1971.103333
%G en
%F 10_21136_AM_1971_103333
Gruber, Boris. On the possibility of applying a computer when solving the four color problem. Applications of Mathematics, Tome 16 (1971) no. 2, pp. 83-97. doi : 10.21136/AM.1971.103333. http://geodesic.mathdoc.fr/articles/10.21136/AM.1971.103333/

Cité par Sources :