<?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 37 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=36">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=38">3.Next</a>
</p>
<p>intersection graph of finite sets can be represented through the smallest number of required elements, known as the <a href="page.php?w=intersection_number_%28graph_theory%29">intersection number</a>. The result graph can be geometric whenever the sets are geometrical objects. For instance, the intersection graph of line segments in one dimension is an <a href="page.php?w=interval_graph">interval graph</a>. The intersection graph of unit disks in the plane is a <a href="page.php?w=unit_disk_graph">unit disk graph</a>. The intersection of a <a href="page.php?w=circle_packing">circle packing</a></p><p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=36">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=38">3.Next</a>
</p>

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

</card>
</wml>
