On the possibility of applying a computer when solving the four color problem
Applications of Mathematics, Tome 16 (1971) no. 2, pp. 83-97
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.
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.
@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},
year = {1971},
volume = {16},
number = {2},
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 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 -
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
Cité par Sources :