<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Graph theory - Page 13 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=graph_theory&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_theory&amp;p=14">3.Next</a>
</p>
<p>map drawn in the plane may have its regions colored with four colors, in such a way that any two regions having a common border have different colors? This problem was first posed by <a href="page.php?w=Francis_Guthrie">Francis Guthrie</a> in 1852, and its first written record is in a letter of <a href="page.php?w=Augustus_De_Morgan">Augustus De Morgan</a> addressed to <a href="page.php?w=William_Rowan_Hamilton">William Rowan Hamilton</a> the same year. Many incorrect proofs have been proposed, including those by Augustin Cayley, <a href="page.php?w=Alfred_Kempe">Alfred Kempe</a>,</p><p>
<a accesskey="1" href="page.php?w=graph_theory&amp;p=12">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_theory&amp;p=14">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
