Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
3 answers
526 views

Enumerating all inequivalent planar embeddings of a planar graph

Graph $G$ can be embedded (or has an embedding) in the space if $G$ can be drawn in the space if $G$ can be drawn in such a way that no two edges cross except at an end-vertex in common. A Graph $G$ ...
Licheng Zhang's user avatar