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 ...