An embedded graph uniquely defines cyclic orders of edges incident to the same vertex.
An embedded graph also defines natural cyclic orders of edges which constitutes the boundaries of the faces of the embedding.