# Schnyder's theorem

Known as: Schnyder theorem, Scnhyder's theorem
In graph theory, Schnyder's theorem is a characterization of planar graphs in termsof the order dimension of their incidence posets. It is named… (More)
Wikipedia

1996-2016

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Schnyder woods are particularly elegant combinatorial structures with numerous applications concerning planar triangulations and… (More)
Is this relevant?
2016
2016
• Daniel Gonçalves
• 2016
We propose a simple generalization of Schnyder woods from the plane to maps on orientable surfaces of higher genus. This is done… (More)
Is this relevant?
2016
2016
Every planar graph has a crossings-free drawing in the plane. Formally, a straight-line drawing of a planar graph G is one where… (More)
Is this relevant?
2015
2015
• ArXiv
• 2015
We propose a simple generalization of Schnyder woods from the plane to maps on orientable surfaces of higher genus. This is done… (More)
Is this relevant?
2015
2015
• J. Graph Algorithms Appl.
• 2015
A straight-line triangle representation (SLTR) of a planar graph is a straight-line drawing such that all the faces including the… (More)
Is this relevant?
2014
2014
• Discrete & Computational Geometry
• 2014
A Schnyder wood is an orientation and coloring of the edges of a planar map satisfying a simple local property. We propose a… (More)
Is this relevant?
2010
2010
• TAMC
• 2010
Geometric routing by using virtual locations is an elegant way for solving network routing problem. In its simplest form, greedy… (More)
Is this relevant?
2009
2009
• Discrete & Computational Geometry
• 2009
Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into 3 spanning… (More)
Is this relevant?
2006
2006
• Graph Drawing
• 2006
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This… (More)
Is this relevant?