For nonplanar surface embeddings, unlike planar duals, the dual graph is not generally an algebraic dual of the primal graph.
The duality between Eulerian and bipartite planar graphs can be extended to binary matroids (which include the graphic matroids derived from planar graphs): a binary matroid is Eulerian if and only if its dual matroid is bipartite [REF].