Hadwiger's conjecture for inflations of 3-chromatic graphs
From MaRDI portal
Publication:499451
Recommendations
Cites work
- scientific article; zbMATH DE number 1156585 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Hadwiger's conjecture and inflations of the Petersen graph
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Hadwiger's conjecture for line graphs
- Hadwiger's conjecture for quasi-line graphs
- Hadwiger's conjecture is true for almost every graph
- Hajos' graph-coloring conjecture: Variations and counterexamples
- More results on \(r\)-inflated graphs: arboricity, thickness, chromatic number and fractional chromatic number
- Normal hypergraphs and the perfect graph conjecture
- On a special case of Hadwiger's conjecture
- Some remarks on Hajós' conjecture
- The thickness and chromatic number of \(r\)-inflated graphs
- Über eine Eigenschaft der ebenen Komplexe
Cited in
(3)
This page was built for publication: Hadwiger's conjecture for inflations of 3-chromatic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499451)