z-logo
open-access-imgOpen Access
The Order Dimension of Planar Maps Revisited
Author(s) -
Stefan Felsner
Publication year - 2014
Publication title -
siam journal on discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.843
H-Index - 66
eISSN - 1095-7146
pISSN - 0895-4801
DOI - 10.1137/130945284
Subject(s) - mathematics , combinatorics , dimension (graph theory) , planar , planar graph , intersection (aeronautics) , order (exchange) , extension (predicate logic) , discrete mathematics , graph , computer graphics (images) , finance , computer science , engineering , economics , programming language , aerospace engineering
Schnyder characterized planar graphs in terms of order dimension. The structures used for the proof have found many applications. Researchers also found several extensions of the seminal result. A particularly far-reaching extension is the Brightwell--Trotter theorem about planar maps. It states that the order dimension of the incidence poset $\mathbf{P}_{\mathbf{M}}$ of vertices, edges, and faces of a planar map $\mathbf{M}$ has dimension at most 4. The original proof generalizes the machinery of Schnyder paths and Schnyder regions. In this short paper we use a simple result about the order dimension of grid intersection graphs to show a slightly stronger result: $\dim(\mathsf{split}(\mathbf{P}_{\mathbf{M}})) \leq 4$. Here, $\mathsf{split}(P)$ refers to a particular order of height two associated with $P$. The Brightwell--Trotter theorem follows because $\dim(\mathsf{split}(P)) \geq \dim(P)$ holds for every $P$. This may be the first result in the area that is obtained without using the tools introduced ...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom