<?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="Edge-transitive graph - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=edge-transitive_graph&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=edge-transitive_graph&amp;p=4">3.Next</a>
</p>
<p>but in general edge-transitive graphs need not be vertex-transitive. Every <a href="page.php?w=Connectivity_%28graph_theory%29">connected</a> edge-transitive graph that is not vertex-transitive must be <a href="page.php?w=bipartite_graph">bipartite</a>, (and hence can be <a href="page.php?w=Graph_coloring">colored</a> with only two colors), and either semi-symmetric or <a href="page.php?w=biregular_graph">biregular</a>.</p>

<p>Examples of edge but not vertex transitive graphs include the <a href="page.php?w=complete_bipartite_graph">complete bipartite graph</a>s</p><p>
<a accesskey="1" href="page.php?w=edge-transitive_graph&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=edge-transitive_graph&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
