Given a cellular embedding of a graph on a surface (by 'surface' I mean here a sphere with some $n\geq 0$ handles), one can define a dual multigraph by treating the faces of the original graph embedding as vertices and adding an edge between two vertices for every side the corresponding faces have in common in the original graph.Here's my problem. Given a simple graph $G$, I need to find another simple graph $G'$ such that there exists a surface $S$ and a cellular embedding of $G$ on $S$ such that $G'$ is the dual of this embedding of $G$. Some simple graphs $G$ do not have simple duals on any surface (for example, a simple path; see JE's comment). On the other hand, I think that for some simple graphs $G$, there can be many possible simple duals $G'$, depending on the surface and the embedding chosen.Question: Given a simple graph $G$, give a method that finds a simple dual graph $G'$, if it exists.None of the embeddings is required to be of minimum genus. The graphs are assumed to be connected.
Finding a simple dual of a simple graph in some surface
ds.algorithms;reference request;graph theory;cg.comp geom;topological graph theory
For 3-regular graphs, having a simple dual is the same thing as having a polyhedral embedding (an embedding in which each face is a simple cycle and every two faces intersect in an empty set, a vertex, or an edge). But testing for the existence of a polyhedral embedding is known to be NP-complete: see B. Mohar, Existence of polyhedral embeddings of graphs, Combinatorica 21 (2001), 395401, http://www.fmf.uni-lj.si/~mohar/Papers/Fw3npc.pdfI'm not sure whether polyhedral embeddability is known to remain NP-complete when restricted to 3-regular graphs  it doesn't seem to be in Mohar's paper  but it seems very likely to be true.