<?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 homomorphism - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=graph_homomorphism&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_homomorphism&amp;p=3">3.Next</a>
</p>
<p>and allow the expression of an important class of <a href="page.php?w=constraint_satisfaction_problem">constraint satisfaction problem</a>s, such as certain <a href="page.php?w=Scheduling_%28production_processes%29">scheduling</a> or <a href="page.php?w=frequency_assignment">frequency assignment</a> problems.The fact that homomorphisms can be composed leads to rich algebraic structures: a <a href="page.php?w=preorder">preorder</a> on graphs, a <a href="page.php?w=distributive_lattice">distributive lattice</a>, and a <a href="page.php?w=category_%28mathematics%29">category</a></p><p>
<a accesskey="1" href="page.php?w=graph_homomorphism&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=graph_homomorphism&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
