<?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 30 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=29">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=31">3.Next</a>
</p>
<p>A graph invariant is a property of graphs that depends only on the abstract structure, instead of labellings or drawings of the graph. A chromatic polynomial is a polynomial that counts the number of graph colorings as a function of the number of colors. The Tutte polynomial is a two-variable polynomial on graph connectivity.</p>

<p><big> Geometric graph theory </big></p>
<p><a href="page.php?w=Geometric_graph_theory">Geometric graph theory</a> focuses on combinatorial and geometric properties of a graph that is drawn in a plane with straight-line or</p><p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=29">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=31">3.Next</a>
</p>

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

</card>
</wml>
