In 1976 Appel and Haken pioneered the use of the computer in proofs in proving this conjecture.  
In 2000, an Indian mathematician used Eilenberg modules, Hall matchings, Riemann surfaces, Steiner systems, and a map of Madhya Pradesh to prove this theorem.  In 1976 Appel and Haken pioneered the use of the computer in proofs in proving this conjecture.  First proposed by Mobius in 1840, FTP, name this mathematical theorem that states that no more than a certain number of colors are needed to fill in a map.
In 2000, an Indian mathematician used Eilenberg modules, Hall matchings, Riemann surfaces, Steiner systems, and a map of Madhya Pradesh to prove this theorem.  
four color theorem