BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help


Search "Four-Colour Map Problem"

Navigation

Four-Colour Map Problem

Print-Friendly  Order the PDF version  Order the RTF version
About 1 pages (53 words)
Four color theorem Summary

In topology, a long-standing conjecture asserting that no more than four colours are required to shade in any map such that each adjacent region is coloured differently.

First posed in 1852 by Francis Guthrie, a British math student, it was solved by Kenneth Appel and Wolfgang Haken using a computer-assisted proof in 1976.

This is the complete article, containing 53 words (approx. 1 page at 300 words per page).

View More Summaries on Four color theorem
More Information
  • View Four-Colour Map Problem Study Pack
  • Search Results for "Four-Colour Map Problem"
  • Add This to Your Bibliography
  • More Products on This Subject
    Four-Color Map Theorem
    The four-color map theorem states that, at most, four colors are needed to color any map, if two ad... more

    Four color theorem
    The four color theorem (also known as the four color map theorem) states that given any plane separa... more


     
    Copyrights
    Four-Colour Map Problem from Encyclopedia Brittanica. ©2009 Encyclopedia Brittanica. All rights reserved.

    Join BookRagslearn moreJoin BookRags




    About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy