Hadwiger's conjecture for inflations of 3-chromatic graphs
From MaRDI portal
Publication:499451
DOI10.1016/j.ejc.2015.05.003zbMath1321.05076OpenAlexW376155919WikidataQ123357707 ScholiaQ123357707MaRDI QIDQ499451
Carl Johan Casselgren, Anders Sune Pedersen
Publication date: 30 September 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2015.05.003
Cites Work
- Unnamed Item
- Unnamed Item
- Some remarks on Hajós' conjecture
- The thickness and chromatic number of \(r\)-inflated graphs
- Hadwiger's conjecture is true for almost every graph
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Hadwiger's conjecture and inflations of the Petersen graph
- Hadwiger's conjecture for line graphs
- Normal hypergraphs and the perfect graph conjecture
- Über eine Eigenschaft der ebenen Komplexe
- More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number
- Hadwiger's conjecture for quasi-line graphs
- On a special case of Hadwiger's conjecture