<?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 16 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=17">3.Next</a>
</p>
<p>for solving the problem using computers. A computer-aided proof produced in 1976 by <a href="page.php?w=Kenneth_Appel">Kenneth Appel</a> and <a href="page.php?w=Wolfgang_Haken">Wolfgang Haken</a> makes fundamental use of the notion of "discharging" developed by Heesch. The proof involved checking the properties of 1,936 configurations by computer, and was not fully accepted at the time due to its complexity. A simpler proof considering only 633 configurations was given twenty years later by <a href="page.php?w=Neil_Robertson_%28mathematician%29">Robertson</a>,</p><p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=17">3.Next</a>
</p>

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

</card>
</wml>
