Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Hadwiger_number> ?p ?o }
Showing triples 1 to 84 of
84
with 100 triples per page.
- Hadwiger_number 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.".
- Hadwiger_number thumbnail Hadwiger_conjecture.svg?width=300.
- Hadwiger_number wikiPageExternalLink 1980-10.pdf.
- Hadwiger_number wikiPageExternalLink hadwiger.pdf.
- Hadwiger_number wikiPageExternalLink lingas7.pdf.
- Hadwiger_number wikiPageID "1665366".
- Hadwiger_number wikiPageLength "10865".
- Hadwiger_number wikiPageOutDegree "55".
- Hadwiger_number wikiPageRevisionID "627386784".
- Hadwiger_number wikiPageWikiLink Apex_graph.
- Hadwiger_number wikiPageWikiLink Biconnected_component.
- Hadwiger_number wikiPageWikiLink Category:Graph_invariants.
- Hadwiger_number wikiPageWikiLink Category:Graph_minor_theory.
- Hadwiger_number wikiPageWikiLink Chromatic_number.
- Hadwiger_number wikiPageWikiLink Clique-sum.
- Hadwiger_number wikiPageWikiLink Clique_(graph_theory).
- Hadwiger_number wikiPageWikiLink Combinatorica.
- Hadwiger_number wikiPageWikiLink Complete_coloring.
- Hadwiger_number wikiPageWikiLink Complete_graph.
- Hadwiger_number wikiPageWikiLink Complete_lattice.
- Hadwiger_number wikiPageWikiLink Cycle_(graph_theory).
- Hadwiger_number wikiPageWikiLink Degeneracy_(graph_theory).
- Hadwiger_number wikiPageWikiLink Dense_graph.
- Hadwiger_number wikiPageWikiLink Discrete_Mathematics_(journal).
- Hadwiger_number wikiPageWikiLink Edge_contraction.
- Hadwiger_number wikiPageWikiLink Empty_graph.
- Hadwiger_number wikiPageWikiLink European_Journal_of_Combinatorics.
- Hadwiger_number wikiPageWikiLink Forbidden_graph_characterization.
- Hadwiger_number wikiPageWikiLink Four_color_theorem.
- Hadwiger_number wikiPageWikiLink Graph_(mathematics).
- Hadwiger_number wikiPageWikiLink Graph_coloring.
- Hadwiger_number wikiPageWikiLink Graph_minor.
- Hadwiger_number wikiPageWikiLink Graph_theory.
- Hadwiger_number wikiPageWikiLink Greedy_coloring.
- Hadwiger_number wikiPageWikiLink Hadwiger_conjecture_(graph_theory).
- Hadwiger_number wikiPageWikiLink Haven_(graph_theory).
- Hadwiger_number wikiPageWikiLink Hugo_Hadwiger.
- Hadwiger_number wikiPageWikiLink Independent_set_(graph_theory).
- Hadwiger_number wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Hadwiger_number wikiPageWikiLink Journal_of_Graph_Algorithms_and_Applications.
- Hadwiger_number wikiPageWikiLink Linkless_embedding.
- Hadwiger_number wikiPageWikiLink NP-complete.
- Hadwiger_number wikiPageWikiLink NP-completeness.
- Hadwiger_number wikiPageWikiLink NP-hard.
- Hadwiger_number wikiPageWikiLink NP-hardness.
- Hadwiger_number wikiPageWikiLink Null_graph.
- Hadwiger_number wikiPageWikiLink Parameterized_complexity.
- Hadwiger_number wikiPageWikiLink Planar_graph.
- Hadwiger_number wikiPageWikiLink Pursuit-evasion.
- Hadwiger_number wikiPageWikiLink Series-parallel_graph.
- Hadwiger_number wikiPageWikiLink Sparse_graph.
- Hadwiger_number wikiPageWikiLink Tree_(graph_theory).
- Hadwiger_number wikiPageWikiLink Treewidth.
- Hadwiger_number wikiPageWikiLink Uncountable.
- Hadwiger_number wikiPageWikiLink Uncountable_set.
- Hadwiger_number wikiPageWikiLink Undirected_graph.
- Hadwiger_number wikiPageWikiLink Vertex_separator.
- Hadwiger_number wikiPageWikiLink Wagner_graph.
- Hadwiger_number wikiPageWikiLink Wagners_theorem.
- Hadwiger_number wikiPageWikiLink File:Clique-sum.svg.
- Hadwiger_number wikiPageWikiLink File:Hadwiger_conjecture.svg.
- Hadwiger_number wikiPageWikiLinkText "Hadwiger number".
- Hadwiger_number hasPhotoCollection Hadwiger_number.
- Hadwiger_number wikiPageUsesTemplate Template:Citation.
- Hadwiger_number wikiPageUsesTemplate Template:Harvtxt.
- Hadwiger_number wikiPageUsesTemplate Template:Radic.
- Hadwiger_number wikiPageUsesTemplate Template:Refbegin.
- Hadwiger_number wikiPageUsesTemplate Template:Refend.
- Hadwiger_number wikiPageUsesTemplate Template:Reflist.
- Hadwiger_number wikiPageUsesTemplate Template:Sfnp.
- Hadwiger_number subject Category:Graph_invariants.
- Hadwiger_number subject Category:Graph_minor_theory.
- Hadwiger_number hypernym Size.
- Hadwiger_number type Organisation.
- Hadwiger_number type Invariant.
- Hadwiger_number type Object.
- Hadwiger_number 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.".
- Hadwiger_number label "Hadwiger number".
- Hadwiger_number sameAs m.0r4ksy2.
- Hadwiger_number sameAs Q5638117.
- Hadwiger_number sameAs Q5638117.
- Hadwiger_number wasDerivedFrom Hadwiger_number?oldid=627386784.
- Hadwiger_number depiction Hadwiger_conjecture.svg.
- Hadwiger_number isPrimaryTopicOf Hadwiger_number.