Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Graph_minor> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Graph_minor abstract "In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges.The theory of graph minors began with Wagner's theorem that a graph is planar if and only if its minors do not include the complete graph K5 nor the complete bipartite graph K3,3. The Robertson–Seymour theorem implies that an analogous forbidden minor characterization exists for every property of graphs that is preserved by deletions and edge contractions.For every fixed graph H, it is possible to test whether H is a minor of an input graph G in polynomial time; together with the forbidden minor characterization this implies that every graph property preserved by deletions and contractions may be recognized in polynomial time.Other results and conjectures involving graph minors include the graph structure theorem, according to which the graphs that do not have H as a minor may be formed by gluing together simpler pieces, and Hadwiger's conjecture relating the inability to color a graph to the existence of a large complete graph as a minor of it. Important variants of graph minors include the topological minors and immersion minors.".
- Graph_minor thumbnail GraphMinorExampleA.png?width=300.
- Graph_minor wikiPageExternalLink 0001128.
- Graph_minor wikiPageExternalLink DiameterTreewidth_Algorithmica.
- Graph_minor wikiPageExternalLink bcc.pdf.
- Graph_minor wikiPageExternalLink home.html.
- Graph_minor wikiPageExternalLink rev-pegg.pdf.
- Graph_minor wikiPageExternalLink hadwiger.pdf.
- Graph_minor wikiPageExternalLink graph.theory.
- Graph_minor wikiPageExternalLink lminors.ps.
- Graph_minor wikiPageExternalLink 1980-10.pdf.
- Graph_minor wikiPageID "353042".
- Graph_minor wikiPageRevisionID "606031656".
- Graph_minor hasPhotoCollection Graph_minor.
- Graph_minor title "Graph Minor".
- Graph_minor urlname "GraphMinor".
- Graph_minor subject Category:Graph_minor_theory.
- Graph_minor subject Category:Graph_theory_objects.
- Graph_minor comment "In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges.The theory of graph minors began with Wagner's theorem that a graph is planar if and only if its minors do not include the complete graph K5 nor the complete bipartite graph K3,3.".
- Graph_minor label "Graph minor".
- Graph_minor label "Mineur (théorie des graphes)".
- Graph_minor label "Minor (Graphentheorie)".
- Graph_minor sameAs Minor_(teorie_grafů).
- Graph_minor sameAs Minor_(Graphentheorie).
- Graph_minor sameAs Mineur_(théorie_des_graphes).
- Graph_minor sameAs 마이너_(그래프_이론).
- Graph_minor sameAs m.01zjj3.
- Graph_minor sameAs Q905837.
- Graph_minor sameAs Q905837.
- Graph_minor wasDerivedFrom Graph_minor?oldid=606031656.
- Graph_minor depiction GraphMinorExampleA.png.
- Graph_minor isPrimaryTopicOf Graph_minor.
