Ranking and Unranking of the Planar Embeddings of a Planar Graph

Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno +1

Let $\mathcal{G}$ be the set of all the planar embeddings of a (not necessarily connected) $n$-vertex graph $G$. We present a bijection $\Phi$ from $\mathcal{G}$ to the natural number…