Abstract. Schnyder characterized planar graphs in terms of order dimension. This seminal result found several extensions. A particularly far reaching extension is the Brightwell-Trotter Theorem about planar maps. It states that the order dimension of the incidence poset P M of vertices, edges and faces of a planar map M has dimension at most 4. The original proof generalizes the machinery of Schnyder-paths and Schnyder-regions. In this note we use a simple result about the order dimension of grid intersection graphs to show a slightly stronger result: dim(split(P
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
We study subclasses of grid intersection graphs from the perspective of order dimension. We show tha...
We study subclasses of grid intersection graphs from the perspective of order dimension. We show tha...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
The central topic of this thesis is Schnyder's Theorem. Schnyder's Theorem provides a characterizat...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. S...
In this thesis, we consider properties of triconnected, planar graphs and devote ourselves to the co...
AbstractThe rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
We study subclasses of grid intersection graphs from the perspective of order dimension. We show tha...
We study subclasses of grid intersection graphs from the perspective of order dimension. We show tha...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
Different areas of discrete mathematics lead to intrinsically different characterizations of planar ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
The central topic of this thesis is Schnyder's Theorem. Schnyder's Theorem provides a characterizat...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. S...
In this thesis, we consider properties of triconnected, planar graphs and devote ourselves to the co...
AbstractThe rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...
The rank (resp. dimension) of a poset P is the cardinality of a largest (resp. smallest) set of line...