Talk:Homeomorphism (graph theory)

From Wikipedia, the free encyclopedia

"The problem of determining whether two graphs G and G′ have subgraphs H, H′ that are homeomorphic is an NP-complete problem". I think this is a trivial problem with the answer .