Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hadwiger_conjecture_(graph_theory)> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- Hadwiger_conjecture_(graph_theory) abstract "In graph theory, the Hadwiger conjecture (or Hadwiger's conjecture) states that, if all proper colorings of an undirected graph G use k or more colors, then one can find k disjoint connected subgraphs of G such that each subgraph is connected by an edge to each other subgraph. Contracting the edges within each of these subgraphs so that each subgraph collapses to a single supervertex produces a complete graph Kk on k vertices as a minor of G.This conjecture, a far-reaching generalization of the four-color problem, was made by Hugo Hadwiger in 1943 and is still unsolved. Bollobás, Catlin & Erdős (1980) call it “one of the deepest unsolved problems in graph theory.”".
- Hadwiger_conjecture_(graph_theory) thumbnail Hadwiger_conjecture.svg?width=300.
- Hadwiger_conjecture_(graph_theory) wikiPageExternalLink 1212.3093v1.pdf.
- Hadwiger_conjecture_(graph_theory) wikiPageExternalLink 106404.
- Hadwiger_conjecture_(graph_theory) wikiPageExternalLink v18i1p232.html.
- Hadwiger_conjecture_(graph_theory) wikiPageExternalLink hadwiger.pdf.
- Hadwiger_conjecture_(graph_theory) wikiPageExternalLink 1980-10.pdf.
- Hadwiger_conjecture_(graph_theory) wikiPageID "1657860".
- Hadwiger_conjecture_(graph_theory) wikiPageRevisionID "581735867".
- Hadwiger_conjecture_(graph_theory) hasPhotoCollection Hadwiger_conjecture_(graph_theory).
- Hadwiger_conjecture_(graph_theory) subject Category:Conjectures.
- Hadwiger_conjecture_(graph_theory) subject Category:Graph_coloring.
- Hadwiger_conjecture_(graph_theory) subject Category:Graph_minor_theory.
- Hadwiger_conjecture_(graph_theory) type Abstraction100002137.
- Hadwiger_conjecture_(graph_theory) type Cognition100023271.
- Hadwiger_conjecture_(graph_theory) type Concept105835747.
- Hadwiger_conjecture_(graph_theory) type Conjectures.
- Hadwiger_conjecture_(graph_theory) type Content105809192.
- Hadwiger_conjecture_(graph_theory) type Hypothesis105888929.
- Hadwiger_conjecture_(graph_theory) type Idea105833840.
- Hadwiger_conjecture_(graph_theory) type PsychologicalFeature100023100.
- Hadwiger_conjecture_(graph_theory) type Speculation105891783.
- Hadwiger_conjecture_(graph_theory) comment "In graph theory, the Hadwiger conjecture (or Hadwiger's conjecture) states that, if all proper colorings of an undirected graph G use k or more colors, then one can find k disjoint connected subgraphs of G such that each subgraph is connected by an edge to each other subgraph.".
- Hadwiger_conjecture_(graph_theory) label "Conjecture de Hadwiger".
- Hadwiger_conjecture_(graph_theory) label "Hadwiger conjecture (graph theory)".
- Hadwiger_conjecture_(graph_theory) label "Hadwigers Vermutung".
- Hadwiger_conjecture_(graph_theory) label "Гипотеза Хадвигера".
- Hadwiger_conjecture_(graph_theory) sameAs Hadwigers_Vermutung.
- Hadwiger_conjecture_(graph_theory) sameAs Conjecture_de_Hadwiger.
- Hadwiger_conjecture_(graph_theory) sameAs m.05l6s0.
- Hadwiger_conjecture_(graph_theory) sameAs Q1128435.
- Hadwiger_conjecture_(graph_theory) sameAs Q1128435.
- Hadwiger_conjecture_(graph_theory) sameAs Hadwiger_conjecture_(graph_theory).
- Hadwiger_conjecture_(graph_theory) wasDerivedFrom Hadwiger_conjecture_(graph_theory)?oldid=581735867.
- Hadwiger_conjecture_(graph_theory) depiction Hadwiger_conjecture.svg.
- Hadwiger_conjecture_(graph_theory) isPrimaryTopicOf Hadwiger_conjecture_(graph_theory).