Coloring a Dodecahedron with Four Colors(1)
Canadian mathematical bulletin, Tome 14 (1971) no. 1, pp. 103-105
Voir la notice de l'article provenant de la source Cambridge University Press
The purpose of this note is to show that there is one and only one coloring of the sides of a dodecahedron with four colors, under the condition that no two adjacent sides share the same color.In [1] Busacker and Saaty give a graphical solution to the game known as “Instant Insanity”.
Ballard, David. Coloring a Dodecahedron with Four Colors(1). Canadian mathematical bulletin, Tome 14 (1971) no. 1, pp. 103-105. doi: 10.4153/CMB-1971-018-1
@article{10_4153_CMB_1971_018_1,
author = {Ballard, David},
title = {Coloring a {Dodecahedron} with {Four} {Colors(1)}},
journal = {Canadian mathematical bulletin},
pages = {103--105},
year = {1971},
volume = {14},
number = {1},
doi = {10.4153/CMB-1971-018-1},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-018-1/}
}
[1] 1. Busacker, R. G. and Saaty, T. L., Finite graphs and networks, McGraw-Hill, New York, 1965, 153-155. Google Scholar
[2] 2. VanDeventer, J., Instant insanity: On a solution by methods of graph theory, Proc. of the Graph Theory Conference at Western Michigan Univ., Nov. 1968. Springer-Verlag lecture notes, Vol. 110. Google Scholar
Cité par Sources :