# Graph Theory: The Four Coloring Theorem Essay

"Every planar map is four colorable," seems like a pretty basic and easily provable statement. However, this simple concept took over one hundred years and involved more than a dozen mathematicians to finally prove it. Throughout the century that many men pondered this idea, many other problems, solutions, and mathematical concepts were created. I find the Four Coloring Theorem to be very interesting because of it's apparent simplicity paired with it's long, laborious struggle to be proved. There is a very long and eventful history that accompanies this theorem.

The concept of the Four Coloring Theorem was born in 1852 when Francis Guthrie noticed that he only needed four different colors

*…show more content…*

Wolfgang Haken was born in Berlin on June 21, 1928. He studied mathematics, physics, and philosophy in Kiel. He received his doctorate in 1953 with a specialization in topology. In 1948 he attended a lecture in which Heesch presented some of his first deliberations and results. Haken worked in Munich as an engineer in the development of microwave technology