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.