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

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?

share|cite|improve this question
    
Are you consider planar graphs? – A.Schulz Aug 23 '12 at 18:21

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.