title: How would you verify that two colored planar graphs are isomorphic?
body: <p>What is an algorithm to deduce whether two colored planar graphs are isomorphic? I am aware that isomorphism is a hard problem for graphs in general, however, according to wikipedia it is possible to solve if the graphs are planar. </p>
  
  <p>The application of this algorithm will be to deduce whether two planar molecules, represented with some graph-based datastructure, are the same (isomorphic). Since nodes represent atoms, the coloring of the graph is simply the type of atom (Hydrogen, Carbon, Nitrogen etc). </p>