# Four questions concerning dual graphs

What are the (combinatorial/algebraic) conditions that the dual - resp. the (weak dual) - of a planar graph is

• unique (independent of its embedding),
• simple (and not a multi-graph)?

Are these four questions logically independent of each other?

-
Are you consider planar graphs? –  A.Schulz Aug 23 '12 at 18:21