Geodesic embeddings and planar graphs

DOI10.1023/B:ORDE.0000009251.68514.8bzbMath1033.05028OpenAlexW2053876549MaRDI QIDQ1425168

Stefan Felsner

Publication date: 15 March 2004

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:orde.0000009251.68514.8b

zbMATH Keywords

graph drawingorder dimensionSchnyder labelingorthogonal surface

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

A simple routing algorithm based on Schnyder coordinates ⋮ Enumeration of corner polyhedra and 3-connected Schnyder labelings ⋮ The Complexity of the Partial Order Dimension Problem: Closing the Gap ⋮ Enumeration of corner polyhedra and 3-connected Schnyder labelings ⋮ A note on Schnyder's theorem ⋮ Triangle contact representations and duality ⋮ Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations ⋮ Orthogonal surfaces and their CP-orders ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs ⋮ Morphing Schnyder drawings of planar triangulations ⋮ Schnyder woods and orthogonal surfaces ⋮ Straight line triangle representations ⋮ Adjacency posets of planar graphs ⋮ The dimension of posets with planar cover graphs.

This page was built for publication: Geodesic embeddings and planar graphs