Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q905837> ?p ?o }
Showing triples 1 to 88 of
88
with 100 triples per page.
- Q905837 subject Q6465276.
- Q905837 subject Q8498914.
- Q905837 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.".
- Q905837 thumbnail GraphMinorExampleA.png?width=300.
- Q905837 wikiPageExternalLink bcc.pdf.
- Q905837 wikiPageExternalLink graph.theory.
- Q905837 wikiPageExternalLink lminors.ps.
- Q905837 wikiPageExternalLink 0001128.
- Q905837 wikiPageExternalLink DiameterTreewidth_Algorithmica.
- Q905837 wikiPageExternalLink home.html.
- Q905837 wikiPageExternalLink rev-pegg.pdf.
- Q905837 wikiPageExternalLink hadwiger.pdf.
- Q905837 wikiPageExternalLink 1980-10.pdf.
- Q905837 wikiPageWikiLink Q1050972.
- Q905837 wikiPageWikiLink Q1128435.
- Q905837 wikiPageWikiLink Q130901.
- Q905837 wikiPageWikiLink Q131476.
- Q905837 wikiPageWikiLink Q1374495.
- Q905837 wikiPageWikiLink Q1391861.
- Q905837 wikiPageWikiLink Q1396427.
- Q905837 wikiPageWikiLink Q1397646.
- Q905837 wikiPageWikiLink Q141488.
- Q905837 wikiPageWikiLink Q1475294.
- Q905837 wikiPageWikiLink Q1531456.
- Q905837 wikiPageWikiLink Q166507.
- Q905837 wikiPageWikiLink Q17086290.
- Q905837 wikiPageWikiLink Q1709878.
- Q905837 wikiPageWikiLink Q18388881.
- Q905837 wikiPageWikiLink Q184410.
- Q905837 wikiPageWikiLink Q2393193.
- Q905837 wikiPageWikiLink Q2404489.
- Q905837 wikiPageWikiLink Q2532492.
- Q905837 wikiPageWikiLink Q2642629.
- Q905837 wikiPageWikiLink Q266775.
- Q905837 wikiPageWikiLink Q269878.
- Q905837 wikiPageWikiLink Q272735.
- Q905837 wikiPageWikiLink Q273037.
- Q905837 wikiPageWikiLink Q2742711.
- Q905837 wikiPageWikiLink Q2894153.
- Q905837 wikiPageWikiLink Q2928101.
- Q905837 wikiPageWikiLink Q2985068.
- Q905837 wikiPageWikiLink Q303100.
- Q905837 wikiPageWikiLink Q3085841.
- Q905837 wikiPageWikiLink Q3115543.
- Q905837 wikiPageWikiLink Q3186905.
- Q905837 wikiPageWikiLink Q3262192.
- Q905837 wikiPageWikiLink Q3527155.
- Q905837 wikiPageWikiLink Q4545823.
- Q905837 wikiPageWikiLink Q45715.
- Q905837 wikiPageWikiLink Q465654.
- Q905837 wikiPageWikiLink Q474715.
- Q905837 wikiPageWikiLink Q4779442.
- Q905837 wikiPageWikiLink Q484298.
- Q905837 wikiPageWikiLink Q504843.
- Q905837 wikiPageWikiLink Q5067368.
- Q905837 wikiPageWikiLink Q512604.
- Q905837 wikiPageWikiLink Q5134410.
- Q905837 wikiPageWikiLink Q5251771.
- Q905837 wikiPageWikiLink Q5412712.
- Q905837 wikiPageWikiLink Q5467387.
- Q905837 wikiPageWikiLink Q547823.
- Q905837 wikiPageWikiLink Q5597085.
- Q905837 wikiPageWikiLink Q5597098.
- Q905837 wikiPageWikiLink Q573901.
- Q905837 wikiPageWikiLink Q584521.
- Q905837 wikiPageWikiLink Q622506.
- Q905837 wikiPageWikiLink Q6465276.
- Q905837 wikiPageWikiLink Q6470127.
- Q905837 wikiPageWikiLink Q64861.
- Q905837 wikiPageWikiLink Q6786838.
- Q905837 wikiPageWikiLink Q6934937.
- Q905837 wikiPageWikiLink Q7144893.
- Q905837 wikiPageWikiLink Q7200963.
- Q905837 wikiPageWikiLink Q7254793.
- Q905837 wikiPageWikiLink Q728368.
- Q905837 wikiPageWikiLink Q7293202.
- Q905837 wikiPageWikiLink Q739462.
- Q905837 wikiPageWikiLink Q7487279.
- Q905837 wikiPageWikiLink Q7837500.
- Q905837 wikiPageWikiLink Q7959587.
- Q905837 wikiPageWikiLink Q835614.
- Q905837 wikiPageWikiLink Q8498914.
- Q905837 wikiPageWikiLink Q913598.
- Q905837 wikiPageWikiLink Q917421.
- Q905837 wikiPageWikiLink Q96013.
- Q905837 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.".
- Q905837 label "Graph minor".
- Q905837 depiction GraphMinorExampleA.png.