Convex drawings of planar graphs and the order dimension of 3-polytopes (Q5947335)

The author defines a decomposition of the edges of a 3-connected planar graph into three directed trees, analogous to one defined by \textit{W. Schnyder} [Order 5, No. 4, 323-343 (1989; Zbl 0675.06001)]. Using this decomposition, he proves that a three-connected planar graph with \(f\) faces has a convex drawing with its vertices embedded on the \((f-1)\times(f-1)\) grid. He also gives a simpler proof of a theorem of \textit{G. R. Brightwell} and \textit{W. T. Trotter} [SIAM J. Discrete Math. 10, No. 4, 515-528 (1997; Zbl 0883.06002)] that the incidence order of the vertices, edges and bounded faces of a 3-connected planar graph has dimension at most 3.