Do you think this definition of homeomorphism in graph theory correct?
"Two graphs are homeomorphic if they become isomorphic when all vertices of degree 2 are removed."
PS: 1) I have not seen this definition anywhere else but I can't 100% claim that somebody else did not use it. 2) I hope it's not correct, because otherwise homeomorphism is usually made out to be much harder than it actually is by other definitions!