<?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="Tree (set theory) - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Tree_(set_theory)&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Tree_%28set_theory%29&amp;p=4">3.Next</a>
</p>
<p>trees in the sense of <a href="page.php?w=graph_theory">graph theory</a> in one of two ways: either as a <a href="page.php?w=tree_%28graph_theory%29">tree (graph theory)</a> or as a <a href="page.php?w=trivially_perfect_graph">trivially perfect graph</a>. In the first case, the graph is the undirected <a href="page.php?w=Hasse_diagram">Hasse diagram</a> of the partially ordered set, and in the second case, the graph is simply the underlying (undirected) graph of the partially ordered set. However, if  is a tree whose height is greater than the</p><p>
<a accesskey="1" href="page.php?w=Tree_(set_theory)&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Tree_%28set_theory%29&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
