A graph 
is called a topological minor, also known as a homeomorphic subgraph, of a graph
if a graph
subdivision of 
is isomorphic to a subgraph of 
.
Every topological minor is also a graph minor, but the reverse is not necessarily true.
The subgraph homeomorphism problem consists of finding a homeomorphic image of a pattern graph 
in an input graph 
.
