Take an undirected graph $ G$ , where every vertice has at least two edges (we count self-loops as two edges). For each vertice $ v$ , we define a regular deg($ v$ )-gon. For each edge between $ v_1$ and $ v_2$ , we glue one of the edges of their polygon together. ThisRead more