A self-dual plane graph is a planar embedding (i.e., a plane graph) of a graph that is isomorphic to its dual
graph. The word "plane" refers to the fixed embedding used to form
the dual graph; it is not merely the assertion that the graph is planar.
Harary and Palmer (1973, p. 273) list the enumeration of self-dual plane graphs as a graphical enumeration problem.
Harary, F. and Palmer, E. M. "A Survey of Graphical Enumeration Problems." In A Survey of Combinatorial Theory (Ed. J. N. Srivastava).
Amsterdam, Netherlands: North-Holland, pp. 259-275, 1973.
