Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have to find an exemple on a 2-connected planar graph whose drawing are all topologically isomorphic but its planar embeddings are not equivalent. I thought to use an cycle and some overturning to changes vertex order. Any help?

share|improve this question

1 Answer 1

Consider a square with a diagonal. This graph can also be drawn as a triangle with an interior point adjacent to two vertices of the triangle.

share|improve this answer

Your Answer

 
discard

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.