Testing Mutual Duality of Planar Graphs

Patrizio Angelini, Thomas Bläsius, Ignaz Rutter

We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic m…