Graph Isomorphism for graphs excluding small topological subgraphs can be efficiently tested in time npolylog(h).
