Hadwiger’s Conjecture (Q2827298)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Hadwiger’s Conjecture (English)

0 references

Open Problems in Mathematics

0 references

publication date

18 October 2016

0 references

zbMATH Keywords

Tutte's conjecture

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-32162-2_13

0 references

Partitioning into graphs with only small components

0 references

Every planar map is four colorable. I: Discharging

0 references

Every planar map is four colorable. II: Reducibility

0 references

Large minors in graphs with given independence number

0 references

Disproof of the list Hadwiger conjecture

0 references

Linear connectivity forces large complete bipartite minors

0 references

Minors in Graphs with High Chromatic Number

0 references

Hadwiger's conjecture is true for almost every graph

0 references

Classes of chromatically unique or equivalent graphs

0 references

Hajos' graph-coloring conjecture: Variations and counterexamples

0 references

An approximate version of Hadwiger's conjecture for claw-free graphs

0 references

The edge-density for \(K_{2,t}\) minors

0 references

Packing seagulls

0 references

Excluding any graph as a minor allows a low tree-width 2-coloring

0 references

A minimum degree condition forcing complete graph immersion

0 references

Immersing small complete graphs

0 references

Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs

0 references

Spanning trees with many leaves

0 references

Surfaces, tree-width, clique-minors, and partitions

0 references

A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

0 references

Topology of series-parallel networks

0 references

A Relative of Hadwiger's Conjecture

0 references

On the conjecture of Hajos

0 references

On the maximum density of graphs which have no subcontraction to \(K^ r\).

0 references

Complete Minors and Independence Number

0 references

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz

0 references

Clique minors in claw-free graphs

0 references

On the odd-minor variant of Hadwiger's conjecture

0 references

On colouring random graphs

0 references

0 references

0 references

Contractions to <i>k</i><sub>8</sub>

0 references

A Weakening of the Odd Hadwiger's Conjecture

0 references

Note on coloring graphs without odd-\(K_k\)-minors

0 references

On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture

0 references

A relaxed Hadwiger's conjecture for list colorings

0 references

Fractional coloring and the odd Hadwiger's conjecture

0 references

Some remarks on the odd Hadwiger's conjecture

0 references

Lower bound of the Hadwiger number of graphs by their average degree

0 references

Dense graphs have \(K_{3,t}\) minors

0 references

Forcing unbalanced complete bipartite minors

0 references

Homomorphieeigenschaften und mittlere Kantendichte von Graphen

0 references

Homomorphiesätze für Graphen

0 references

Über trennende Eckenmengen in homomorphiekritischen Graphen

0 references

The extremal function for unbalanced bipartite minors

0 references

The extremal function for noncomplete minors

0 references

Fractional colouring and Hadwiger's conjecture

0 references

Hadwiger's conjecture for line graphs

0 references

Forcing a sparse minor

0 references

Graph minors. XVI: Excluding a non-planar graph

0 references

Excluding Subdivisions of Infinite Cliques

0 references

Hadwiger's conjecture for \(K_ 6\)-free graphs

0 references

The extremal function for \(K_{9}\) minors

0 references

An extremal function for contractions of graphs

0 references

The extremal function for complete minors

0 references

Every planar graph is 5-choosable

0 references

Totally odd \(K_4\)-subdivisions in 4-chromatic graphs

0 references

On the algebraic theory of graph colorings

0 references

List colourings of planar graphs

0 references

Beweis einer Abschwächung der Hadwiger-Vermutung

0 references

Contractibility and the Hadwiger conjecture

0 references

On tree-partition-width

0 references

Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-32162-2_13

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2827298

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2827298&oldid=36280740"