Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We studied a potential petroleum source rock deposited in a clastic-dominated ramp environment: the Argiles de Châtillon… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
Complex risks di er from simple risks in that agents facing them only possess imperfect information about the underlying… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
Is this relevant?
2013
2013
Geometric routing is an elegant way for solving network routing problems. The essence of this routing scheme is the following… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Geometric routing by using virtual locations is an elegant way for solving network routing problems. Greedy routing, where a… Expand
Is this relevant?
2011
2011
We give an alternate proof of Schnyder’s Theorem, that the incidence poset of a graph G has dimension at most three if and only… Expand
  • figure 1
Is this relevant?
2009
2009
Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into three… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
This paper concentrates on the Nixon-Kissinger view of European political integration. In contrast with the mainstream position… Expand
Is this relevant?
2007
2007
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with n vertices in a grid of size… Expand
Is this relevant?