Orthogonal surfaces and their CP-orders
DOI10.1007/s11083-007-9075-zzbMath1149.05036arXivmath/0602063OpenAlexW2155755180MaRDI QIDQ925257
Publication date: 3 June 2008
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602063
planar graphspolytopehigher dimensionsorder dimensionface latticecharacteristic pointsfour dimensionsSchnyder woodsdominance orderscp-ordersorthogonal surfacethree-polytopes
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strictly convex drawings of planar graphs
- Optimal coding and sampling of triangulations
- Convex drawings of 3-connected plane graphs
- Separating pairs of points of standard boxes
- Planar graphs and poset dimension
- Dimension and automorphism groups of lattices
- Output-sensitive reporting of disjoint paths
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory
- The order dimension of the complete graph
- Geodesic embeddings and planar graphs
- Planar graphs as minimal resolutions of trivariate monomial ideals
- Lattice structures from planar graphs
- On degrees in the hasse diagram of the strong Bruhat order
- Schnyder Woods and Orthogonal Surfaces
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- The Order Dimension of Convex Polytopes
- Posets and planar graphs
- Minimal scrambling sets of simple orders
- On topological aspects of orientations
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: Orthogonal surfaces and their CP-orders