Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Wagners_theorem> ?p ?o }
Showing triples 1 to 51 of
51
with 100 triples per page.
- Wagners_theorem abstract "In graph theory, Wagner's theorem is a mathematical forbidden graph characterization of planar graphs, named after Klaus Wagner, stating that a finite graph is planar if and only if its minors include neither K5 (the complete graph on five vertices) nor K3,3 (the utility graph, a complete bipartite graph on six vertices). This was one of the earliest results in the theory of graph minors and can be seen as a forerunner of the Robertson–Seymour theorem.".
- Wagners_theorem thumbnail Petersen_Wagner_minors.svg?width=300.
- Wagners_theorem wikiPageID "3126130".
- Wagners_theorem wikiPageLength "7443".
- Wagners_theorem wikiPageOutDegree "35".
- Wagners_theorem wikiPageRevisionID "705668217".
- Wagners_theorem wikiPageWikiLink Category:Graph_minor_theory.
- Wagners_theorem wikiPageWikiLink Category:Planar_graphs.
- Wagners_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Wagners_theorem wikiPageWikiLink Clique-sum.
- Wagners_theorem wikiPageWikiLink Complete_bipartite_graph.
- Wagners_theorem wikiPageWikiLink Complete_graph.
- Wagners_theorem wikiPageWikiLink Forbidden_graph_characterization.
- Wagners_theorem wikiPageWikiLink Graph_(discrete_mathematics).
- Wagners_theorem wikiPageWikiLink Graph_drawing.
- Wagners_theorem wikiPageWikiLink Graph_embedding.
- Wagners_theorem wikiPageWikiLink Graph_minor.
- Wagners_theorem wikiPageWikiLink Graph_structure_theorem.
- Wagners_theorem wikiPageWikiLink Graph_theory.
- Wagners_theorem wikiPageWikiLink Graphic_matroid.
- Wagners_theorem wikiPageWikiLink Homeomorphism_(graph_theory).
- Wagners_theorem wikiPageWikiLink K-vertex-connected_graph.
- Wagners_theorem wikiPageWikiLink Klaus_Wagner.
- Wagners_theorem wikiPageWikiLink Kuratowskis_theorem.
- Wagners_theorem wikiPageWikiLink Matroid.
- Wagners_theorem wikiPageWikiLink Matroid_minor.
- Wagners_theorem wikiPageWikiLink Multigraph.
- Wagners_theorem wikiPageWikiLink Path_(graph_theory).
- Wagners_theorem wikiPageWikiLink Planar_graph.
- Wagners_theorem wikiPageWikiLink Robertson–Seymour_theorem.
- Wagners_theorem wikiPageWikiLink Three_utilities_problem.
- Wagners_theorem wikiPageWikiLink Two-dimensional_space.
- Wagners_theorem wikiPageWikiLink Vertex_(graph_theory).
- Wagners_theorem wikiPageWikiLink Wagner_graph.
- Wagners_theorem wikiPageWikiLink File:Clique-sum.svg.
- Wagners_theorem wikiPageWikiLink File:Petersen_Wagner_minors.svg.
- Wagners_theorem wikiPageWikiLinkText "Wagner's theorem".
- Wagners_theorem wikiPageUsesTemplate Template:Reflist.
- Wagners_theorem subject Category:Graph_minor_theory.
- Wagners_theorem subject Category:Planar_graphs.
- Wagners_theorem subject Category:Theorems_in_graph_theory.
- Wagners_theorem hypernym Characterization.
- Wagners_theorem type Theorem.
- Wagners_theorem comment "In graph theory, Wagner's theorem is a mathematical forbidden graph characterization of planar graphs, named after Klaus Wagner, stating that a finite graph is planar if and only if its minors include neither K5 (the complete graph on five vertices) nor K3,3 (the utility graph, a complete bipartite graph on six vertices). This was one of the earliest results in the theory of graph minors and can be seen as a forerunner of the Robertson–Seymour theorem.".
- Wagners_theorem label "Wagner's theorem".
- Wagners_theorem sameAs Q7959587.
- Wagners_theorem sameAs m.0pl1ytk.
- Wagners_theorem sameAs Q7959587.
- Wagners_theorem wasDerivedFrom Wagners_theorem?oldid=705668217.
- Wagners_theorem depiction Petersen_Wagner_minors.svg.
- Wagners_theorem isPrimaryTopicOf Wagners_theorem.