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

I need to prove that if graph $G$ is planar, then a graph created from it by joining two vertices $v,u$ on edge $e$ and connecting to a newly created vertex all others that were connected to either $v,u$ (and creating $G'e$ in the process) is planar too. Here's and example: enter image description here

How in the world should I prove that? It's obvious that a graph created this way satisfies the Euler formula for planar graphs, but is it indeed planar?

share|cite|improve this question
up vote 2 down vote accepted

Hint: use Kuratowski's theorem to prove that you can't induce some $K_5$ or $K_{3,3}$ in $G/e$.

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.