1
$\begingroup$

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?

  • 0
    Are you consider planar graphs?2012-08-23

0 Answers 0