<?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="Kirchhoff&#039;s theorem - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Kirchhoff's_theorem&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Kirchhoff%27s_theorem&amp;p=3">3.Next</a>
</p>
<p>that the number of spanning trees can be computed from the graph data in <a href="page.php?w=polynomial_time">polynomial time</a>. Kirchhoff's theorem is a generalization of <a href="page.php?w=Cayley%27s_formula">Cayley's formula</a> which provides the number of spanning trees in a <a href="page.php?w=complete_graph">complete graph</a>. The theorem is named after the German mathematician <a href="page.php?w=Gustav_Kirchhoff">Gustav Kirchhoff</a>, who published it in 1847. An English translation of Kirchhoff's paper was published in 1958.</p>

<p><big> Definitions and statement </big></p><p>
<a accesskey="1" href="page.php?w=Kirchhoff's_theorem&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Kirchhoff%27s_theorem&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
