Hostname: page-component-76fb5796d-vvkck Total loading time: 0 Render date: 2024-04-25T11:45:18.140Z Has data issue: false hasContentIssue false
  • English
  • Français

Coloring a Dodecahedron with Four Colors(1)

Published online by Cambridge University Press:  20 November 2018

David Ballard
David Ballard*
Affiliation:
Albion College, Albion, Michigan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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”.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 14 , Issue 1 , January 1971 , pp. 103 - 105
Copyright
Copyright © Canadian Mathematical Society 1971

Footnotes

(1)

Presented at the annual meeting of the Michigan section of the Mathematical Association of America, March 31, 1969.

References

1. Busacker, R. G. and Saaty, T. L., Finite graphs and networks, McGraw-Hill, New York, 1965, 153-155.Google Scholar
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