Hadwiger’s Conjecture (Q2827298): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q705887
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: P. D. Seymour / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-32162-2_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2504259738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning into graphs with only small components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large minors in graphs with given independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of the list Hadwiger conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity forces large complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors in Graphs with High Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is true for almost every graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of chromatically unique or equivalent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Hadwiger's conjecture for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-density for \(K_{2,t}\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing seagulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding any graph as a minor allows a low tree-width 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum degree condition forcing complete graph immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immersing small complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surfaces, tree-width, clique-minors, and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relative of Hadwiger's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conjecture of Hajos / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum density of graphs which have no subcontraction to \(K^ r\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Minors and Independence Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique minors in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the odd-minor variant of Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractions to <i>k</i><sub>8</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weakening of the Odd Hadwiger's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on coloring graphs without odd-\(K_k\)-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed Hadwiger's conjecture for list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional coloring and the odd Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the odd Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs have \(K_{3,t}\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing unbalanced complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über trennende Eckenmengen in homomorphiekritischen Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for unbalanced bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for noncomplete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional colouring and Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing a sparse minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding Subdivisions of Infinite Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for \(K_{9}\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally odd \(K_4\)-subdivisions in 4-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beweis einer Abschwächung der Hadwiger-Vermutung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and the Hadwiger conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partition-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable / rank
 
Normal rank

Latest revision as of 18:51, 12 July 2024

scientific article
Language Label Description Also known as
English
Hadwiger’s Conjecture
scientific article

    Statements

    Hadwiger’s Conjecture (English)
    0 references
    18 October 2016
    0 references
    Tutte's conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers