Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Schnyder's_theorem> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- Schnyder's_theorem abstract "In graph theory, Schnyder's theorem is a characterization of planar graphs in termsof the order dimension of their incidence posets. It is named after Walter Schnyder, who published its proof in 1989.The incidence poset P(G) of an undirected graph G with vertex set V and edge set E is the partially ordered set of height 2 that has V ∪ E as its elements. In this partial order, there is an order relation x < y when x is a vertex, y is an edge, and x is one of the two endpoints of y.The order dimension of a partial order is the smallest number of total orderings whose intersection is the given partial order; such a set of orderings is called a realizer of the partial order.Schnyder's theorem states that a graph G is planar if and only if the order dimension of P(G) is at most three.".
- Schnyder's_theorem wikiPageID "3122052".
- Schnyder's_theorem wikiPageRevisionID "549917573".
- Schnyder's_theorem hasPhotoCollection Schnyder's_theorem.
- Schnyder's_theorem last "Brightwell".
- Schnyder's_theorem last "Ossona de Mendez".
- Schnyder's_theorem last "Trotter".
- Schnyder's_theorem year "1993".
- Schnyder's_theorem year "1997".
- Schnyder's_theorem year "1999".
- Schnyder's_theorem year "2002".
- Schnyder's_theorem subject Category:Order_theory.
- Schnyder's_theorem subject Category:Planar_graphs.
- Schnyder's_theorem subject Category:Theorems_in_graph_theory.
- Schnyder's_theorem type Abstraction100002137.
- Schnyder's_theorem type Communication100033020.
- Schnyder's_theorem type Graph107000195.
- Schnyder's_theorem type Message106598915.
- Schnyder's_theorem type PlanarGraphs.
- Schnyder's_theorem type Proposition106750804.
- Schnyder's_theorem type Statement106722453.
- Schnyder's_theorem type Theorem106752293.
- Schnyder's_theorem type TheoremsInDiscreteMathematics.
- Schnyder's_theorem type VisualCommunication106873252.
- Schnyder's_theorem comment "In graph theory, Schnyder's theorem is a characterization of planar graphs in termsof the order dimension of their incidence posets. It is named after Walter Schnyder, who published its proof in 1989.The incidence poset P(G) of an undirected graph G with vertex set V and edge set E is the partially ordered set of height 2 that has V ∪ E as its elements.".
- Schnyder's_theorem label "Schnyder's theorem".
- Schnyder's_theorem sameAs 슈나이더의_정리.
- Schnyder's_theorem sameAs m.08svp5.
- Schnyder's_theorem sameAs Q7431925.
- Schnyder's_theorem sameAs Q7431925.
- Schnyder's_theorem sameAs Schnyder's_theorem.
- Schnyder's_theorem wasDerivedFrom Schnyder's_theorem?oldid=549917573.
- Schnyder's_theorem isPrimaryTopicOf Schnyder's_theorem.