Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Fáry's theoremGraph coloringGraph theoryIncidence poset

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Trading Complex Risks
This paper studies how complexity impacts markets’ ability to aggregate information and distribute risks. I amend fundamental… 
2014
2014
Morphing planar triangulations
A morph between two drawings of the same graph can be thought of as a continuous deformation between the two given drawings. A… 
2014
2014
Another Characterization of Straight Line Triangle Representations
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the… 
2013
2013
Régimen político y límite a la acción colectiva: el caso de Santiago del Estero, Argentina
Este articulo analiza un movimiento social, generado por personas y organizaciones marginales de la estructura socioeconomica y… 
2011
2011
Linear-Time Algorithms for Proportional Contact Graph Representations ?
In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional… 
Highly Cited
2010
Highly Cited
2010
The Strategic Planning of EU Military Operations - The Case of EUFOR TCHAD / RCA
On 28 January 2008 the European Union launched the military operation EUFOR in Chad and the Central African Republic. Its mandate… 
Review
2010
Review
2010
Regular labelings and geometric structures
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be… 
2009
2009
SCHNYDER WOODS FOR HIGHER GENUS TRIANGULATED SURFACES 3 Schaeffer
Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into 3 spanning… 
2007
2007
On Planar Polyline Drawings
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with n vertices in a grid of size… 
2005
2005
Exclusion of Nine Positional Candidate Genes for Schnyder Crystalline Corneal Dystrophy
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)