1
$\begingroup$

Is there a criterion which decides whether a given rotation system for a graph determines a planar embedding? That is, a lemma of the form:

A graph G = (V, E) is planar if and only if there exists an ordering of the edges incident to v for all v such that ...

$\endgroup$
5
$\begingroup$

The ordering of edges around each vertex allows to find the cycles that bound the faces. In particular, one can compute the number of faces. The given ordering corresponds to a planar embedding if and only if $|V| - |E| + |F| = 2$.

$\endgroup$

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.