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?
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.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top