Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5638117> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples per page.
- Q5638117 subject Q6465283.
- Q5638117 subject Q8498914.
- Q5638117 abstract "In graph theory, the Hadwiger number of an undirected graph G is the size of the largest complete graph that can be obtained by contracting edges of G.Equivalently, the Hadwiger number h(G) is the largest number k for which the complete graph Kk is a minor of G, a smaller graph obtained from G by edge contractions and vertex and edge deletions. The Hadwiger number is also known as the contraction clique number of G or the homomorphism degree of G. It is named after Hugo Hadwiger, who introduced it in 1943 in conjunction with the Hadwiger conjecture, which states that the Hadwiger number is always at least as large as the chromatic number of G.The graphs that have Hadwiger number at most four have been characterized by Wagner (1937). The graphs with any finite bound on the Hadwiger number are sparse, and have small chromatic number. Determining the Hadwiger number of a graph is NP-hard but fixed-parameter tractable.".
- Q5638117 thumbnail Hadwiger_conjecture.svg?width=300.
- Q5638117 wikiPageExternalLink hadwiger.pdf.
- Q5638117 wikiPageExternalLink lingas7.pdf.
- Q5638117 wikiPageExternalLink 1980-10.pdf.
- Q5638117 wikiPageWikiLink Q1060343.
- Q5638117 wikiPageWikiLink Q1128435.
- Q5638117 wikiPageWikiLink Q1128796.
- Q5638117 wikiPageWikiLink Q1137554.
- Q5638117 wikiPageWikiLink Q116655.
- Q5638117 wikiPageWikiLink Q131476.
- Q5638117 wikiPageWikiLink Q1397646.
- Q5638117 wikiPageWikiLink Q141488.
- Q5638117 wikiPageWikiLink Q1570441.
- Q5638117 wikiPageWikiLink Q15710060.
- Q5638117 wikiPageWikiLink Q184410.
- Q5638117 wikiPageWikiLink Q215206.
- Q5638117 wikiPageWikiLink Q2300244.
- Q5638117 wikiPageWikiLink Q2362924.
- Q5638117 wikiPageWikiLink Q245595.
- Q5638117 wikiPageWikiLink Q272735.
- Q5638117 wikiPageWikiLink Q2985068.
- Q5638117 wikiPageWikiLink Q3033506.
- Q5638117 wikiPageWikiLink Q3085841.
- Q5638117 wikiPageWikiLink Q3115543.
- Q5638117 wikiPageWikiLink Q3186905.
- Q5638117 wikiPageWikiLink Q3342988.
- Q5638117 wikiPageWikiLink Q45715.
- Q5638117 wikiPageWikiLink Q4779442.
- Q5638117 wikiPageWikiLink Q504843.
- Q5638117 wikiPageWikiLink Q5067368.
- Q5638117 wikiPageWikiLink Q5134410.
- Q5638117 wikiPageWikiLink Q5251771.
- Q5638117 wikiPageWikiLink Q5282038.
- Q5638117 wikiPageWikiLink Q5412712.
- Q5638117 wikiPageWikiLink Q5467387.
- Q5638117 wikiPageWikiLink Q547823.
- Q5638117 wikiPageWikiLink Q5601715.
- Q5638117 wikiPageWikiLink Q5683658.
- Q5638117 wikiPageWikiLink Q6465283.
- Q5638117 wikiPageWikiLink Q6554389.
- Q5638117 wikiPageWikiLink Q7261573.
- Q5638117 wikiPageWikiLink Q7454787.
- Q5638117 wikiPageWikiLink Q761631.
- Q5638117 wikiPageWikiLink Q7922780.
- Q5638117 wikiPageWikiLink Q7959587.
- Q5638117 wikiPageWikiLink Q8498914.
- Q5638117 wikiPageWikiLink Q905837.
- Q5638117 comment "In graph theory, the Hadwiger number of an undirected graph G is the size of the largest complete graph that can be obtained by contracting edges of G.Equivalently, the Hadwiger number h(G) is the largest number k for which the complete graph Kk is a minor of G, a smaller graph obtained from G by edge contractions and vertex and edge deletions. The Hadwiger number is also known as the contraction clique number of G or the homomorphism degree of G.".
- Q5638117 label "Hadwiger number".
- Q5638117 depiction Hadwiger_conjecture.svg.