<?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="Bipartite graph - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Bipartite_graph&amp;p=2">3.Next</a>
</p>
<p>In the <a href="page.php?w=mathematics">mathematical</a> field of <a href="page.php?w=graph_theory">graph theory</a>, a <b>bipartite graph</b> (or <b>bigraph</b>) is a <a href="page.php?w=Graph_%28discrete_mathematics%29">graph</a> whose <a href="page.php?w=vertex_%28graph_theory%29">vertices</a> can be divided into two <a href="page.php?w=disjoint_sets">disjoint</a> and <a href="page.php?w=Independent_set_%28graph_theory%29">independent sets</a>  and , that is, every <a href="page.php?w=edge_%28graph_theory%29">edge</a> connects a <a href="page.php?w=Vertex_%28graph_theory%29">vertex</a></p><p>
<a accesskey="3" href="page.php?w=Bipartite_graph&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
