1
$\begingroup$

Find a 2-connected planar graph whose drawings are all topologically isomorphic, but whose planar embeddings are not all equivalent.

I think $K_{2,3}$ might be an example, but I'm not sure how to show this at all. Anything would be welcome.

  • 0
    Like K_{2,4} or something?2011-02-08

2 Answers 2

1

The planar 3-connected graphs, which are the vertex-edge graphs of 3-dimensional convex polyhedra have essentially only one way to be embedded in the plane, by a theorem of Hassler Whitney. Though such embeddings may look different because the number of sides of the infinite face in different drawings may differ, the different embeddings are isomorphic. What can be accomplished using two vertices joined by paths of different lengths when the graph might be embedded in the plane in different ways?

0

I think this might be K_{2,4} and I'm more or less sure. If anyone could confirm or say whether this is correct or not, would be nice. Just see that there's an automorphism that doesn't translate to a topological isomorphism.