Two graphs G and H are isomorphic if there is a bijection φ: V(G)→V(H) preserving all edges. We animate the vertex mapping φ and check if it's valid. Nodes with the same color are mapped together.
Degree sequence is a necessary (not sufficient) certificate. For small graphs, backtracking search finds the isomorphism exactly.