<?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 canonization - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=graph_canonization&amp;p=2">3.Next</a>
</p>
<p>In <a href="page.php?w=graph_theory">graph theory</a>, a branch of mathematics, <b>graph canonization</b> is the problem of finding a <a href="page.php?w=canonical_form">canonical form</a> of a given graph G. A canonical form is a <a href="page.php?w=Graph_labeling">labeled graph</a> Canon(G) that is <a href="page.php?w=graph_isomorphism">isomorphic</a> to G, such that every graph that is isomorphic to G has the same canonical form as G. Thus, from a solution to the graph canonization problem, one could also solve the problem of <a href="page.php?w=graph_isomorphism">graph isomorphism</a>:</p><p>
<a accesskey="3" href="page.php?w=graph_canonization&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
