Abstract
Schnyder labelings are known to have close links to order dimension and drawings of planar graphs. It was observed by Ezra Miller that geodesic embeddings of planar graphs are another class of combinatorial or geometric objects closely linked to Schnyder labelings. We aim to contribute to a better understanding of the connections between these objects. In this article we prove
• a characterization of 3-connected planar graphs as those graphs admitting rigid geodesic embeddings,
• a bijection between Schnyder labelings and rigid geodesic embeddings,
• a strong version of the Brightwell–Trotter theorem.
Similar content being viewed by others
References
Bonichon, N., Le Saëc, B. and Mosbah, M.: Wagners theorem on realizers, In: P. Widmayer (ed), Proc. ICALP' 02, Lecture Notes in Comput. Sci. 2380, Springer, New York, 2002.
Brehm, E.: 3-orientations and Schnyder 3-tree-decompositions, Diplomarbeit, Freie Universität Berlin, Germany, 2000. http://www.inf.fu-berlin.de/~felsner/Diplomarbeiten/brehm.ps.gz.
Brightwell, G. and Trotter, W. T.: The order dimension of convex polytopes, SIAM J. Discrete Math. 6 (1993), 230–245.
Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes, Order 18 (2001), 19–37.
Felsner, S.: Lattice structures from planar graph, submitted, 2002.
Miller, E.: Planar graphs as minimal resolutions of trivariate monomial ideals, Documenta Math. 7 (2002), 43–90.
Schnyder, W.: Planar graphs and poset dimension, Order 5 (1989), 323–343.
Schnyder, W.: Embedding planar graphs on the grid, In: Proc. 1st ACM-SIAMSympos. Discrete Algorithms, 1990, pp. 138–148.
Trotter, W. T.: Combinatorics and Partially Ordered Sets: Dimension Theory, Johns Hopkins Ser. Math. Sci., The Johns Hopkins Univ. Press, 1992.
Trotter, W. T.: Partially ordered sets, In: R. Graham, M. Grötschel and L. Lovaśz (eds), Handbook of Combinatorics, Vol. I, North-Holland, 1995, pp. 433–480.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Felsner, S. Geodesic Embeddings and Planar Graphs. Order 20, 135–150 (2003). https://doi.org/10.1023/B:ORDE.0000009251.68514.8b
Issue Date:
DOI: https://doi.org/10.1023/B:ORDE.0000009251.68514.8b