Bipartite partial duals and circuits in medial graphs (Q485497)

A graph \(G\) cellularly embedded on a surface has a natural geometric dual on the same surface formed by swapping the roles of vertices and faces while preserving adjacency. A plane graph is Eulerian if and only if its goemetric dual is bipartite. \textit{S. Chmutov} [J. Comb. Theory, Ser. B 99, No. 3, 617--638 (2009; Zbl 1172.05015)] introduced a partial dual based on dualizing only edges from a subset \(A \subset E(G)\). This partial dual may be on a different surface. It can be described in terms of ribbon graphs and arrow-marked ribbon graphs, or in terms of a 3-edge-colorable GEM corresponding to the embedding of \(G\). The authors characterize all bipartite partial duals of a plane graph. They use oriented circuits in the embedding's medial graph.