<?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="Dual graph - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=dual_graph&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=dual_graph&amp;p=3">3.Next</a>
</p>
<p>the same face appears on both sides of an edge. Thus, each edge  of  has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of&nbsp;. The definition of the dual depends on the choice of embedding of the graph , so it is a property of plane graphs (graphs that are already embedded in the plane) rather than <a href="page.php?w=planar_graph">planar graph</a>s (graphs that may be embedded but for which the embedding is not yet known). For planar graphs generally, there may be multiple dual graphs,</p><p>
<a accesskey="1" href="page.php?w=dual_graph&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=dual_graph&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
