Suppose you are given two isomorphic graphs $G$ and $H$. Is there an efficient way of defining an isomorphism $\phi:V(G) 
\to V(H)$ if we already know they are isomorphic? Or is it just a guess and check process?