On the maximum partial-dual genus of a planar graph

Jiaying Chen, Xian'an Jin, Gang Zhang

Let $G$ be an embedded graph and $A$ an edge subset of $G$. The partial dual of $G$ with respect to $A$, denoted by $G^A$, can be viewed as the geometric dual $G^{\ast }$ of $G$ over $A$…