Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Does some algorithm exist that can be used to check if graph $A$ and graph $B$ are related only by combining or separating vertices?

Also, would this be possible if vertices had values (a vertex's value, when split, would be shared in some proportion with the new two vertices).

Approaching this from a brute-force point of view would be too computationally expensive.

share|cite|improve this question
What does it mean to combine or separate vertices? – Jernej Jun 20 '12 at 18:15
Gerry's answer is exactly what I meant. Combining is contracting. – 827 Jun 21 '12 at 13:57
up vote 0 down vote accepted

Garey and Johnson, Computers and Intractability, list of NP-complete problems, page 202, item GT51:

Graph Contractability. Given graphs $G,H$, can a graph isomorphic to $H$ be obtained from $G$ by a sequence of edge contractions? Proved NP-complete by Statman in 1976 (private communication), by transformation from 3-Satisfiability.

It doesn't help any if you allow identification of non-adjacent vertices. That's GT52, Graph Homomorphism, proved NP-complete by Levin, Universal sorting problems, Problems of Information Transmission 9 (1973) 265-266.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.