Schnyder's theorem

Schnyder's theorem, or Schnyder's realizability theorem, is a result in graph theory that relates to the representation of planar graphs. It states that: **Every simple planar graph can be embedded in the plane such that its vertices can be labeled with numbers from {0, 1, 2, 3} so that the edges of the graph respect certain ordering conditions.