Math Problem
Pages 3 (753 words)
Download 0
Edge coloring is a major problem of graph coloring. For a dodecahedron, 3-edge coloring assigns colors to different edges of the dodecahedron. Proper 3-edge coloring is done in a way that ensures that none of the vertexes of the dodecahedron has 2 edges whjich have the same colour leaving it.


For a dodecahedron, at least 3 different colors are required, as a dodecahedron cannot be properly colored in less than 3 colours. It is advisable to draw the planar graph of a a dodecahedron when planning the 3-edge coloring. "It is always quite puzzling to try to make use only 3 colors of paper with no two units of the same color touching. Each unit corresponds to an edge of the planar graph, so this is equivalent to a proper 3-edge-coloring of the polyhedron." (T.Hull, 2006)
During the nineteenth century, Sir William Rowan Hamilton who was a mathematician from Ireland, invented a puzzle known as 'Around the World.' The concept behind the puzzle was to label the vertices of a regular dodecahedron according to the names of various cities of the world. Hamilton's puzzle can be solved by beginning from any given city (i.e. any vertex) and traveling around the world from one city (vertex) to another. This entails that one moves along the edges of the dodecahedron in such a manner that each other city is touched only once before going back to the original vertex or starting point. This solution to Hamilton's puzzle is known as a Hamilton cycle/Hamilton circuit. ...
Download paper
Not exactly what you need?