Consider a general planar graph, with no pair of vertexes being joined by more than one edge.
Is there a upper limit of planer embeddings of such graph? That is, in how many ways maximum can such a graph admit planar embedding? for any subclass of such graphs? lower limit is one, obviously.