Skip to main content
Log in

Geodesic Embeddings and Planar Graphs

  • Published:
Order Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Google Scholar 

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

    Google Scholar 

  3. Brightwell, G. and Trotter, W. T.: The order dimension of convex polytopes, SIAM J. Discrete Math. 6 (1993), 230–245.

    Article  MATH  MathSciNet  Google Scholar 

  4. Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes, Order 18 (2001), 19–37.

    Article  MATH  MathSciNet  Google Scholar 

  5. Felsner, S.: Lattice structures from planar graph, submitted, 2002.

  6. Miller, E.: Planar graphs as minimal resolutions of trivariate monomial ideals, Documenta Math. 7 (2002), 43–90.

    MATH  Google Scholar 

  7. Schnyder, W.: Planar graphs and poset dimension, Order 5 (1989), 323–343.

    Article  MATH  MathSciNet  Google Scholar 

  8. Schnyder, W.: Embedding planar graphs on the grid, In: Proc. 1st ACM-SIAMSympos. Discrete Algorithms, 1990, pp. 138–148.

  9. Trotter, W. T.: Combinatorics and Partially Ordered Sets: Dimension Theory, Johns Hopkins Ser. Math. Sci., The Johns Hopkins Univ. Press, 1992.

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

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ORDE.0000009251.68514.8b

Navigation