<?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 minor - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=graph_minor&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_minor&amp;p=5">3.Next</a>
</p>
<p>to the existence of a large <a href="page.php?w=complete_graph">complete graph</a> as a minor of it. Important variants of graph minors include the topological minors and immersion minors.</p>

<p><big>Definitions</big></p>
<p>An edge contraction is an operation that removes an edge from a graph while simultaneously merging the two vertices it used to connect. An <a href="page.php?w=undirected_graph">undirected graph</a>  is a minor of another undirected graph  if a <a href="page.php?w=Graph_isomorphism">graph isomorphic</a> to  can be obtained from </p><p>
<a accesskey="1" href="page.php?w=graph_minor&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_minor&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
