Refined List Version of Hadwiger’s Conjecture

DOI10.1137/22m1522413zbMath1519.05075arXiv2209.07013WikidataQ122960554 ScholiaQ122960554MaRDI QIDQ6171265

Xuding Zhu, Yangyan Gu, David R. Wood, Yiting Jiang

Publication date: 11 August 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.07013

zbMATH Keywords

Hadwiger's conjecture\((a,b)\)-list coloring\(\lambda\)-choosablity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disproof of the list Hadwiger conjecture
• List colourings of planar graphs
• Lower bound of the Hadwiger number of graphs by their average degree
• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• Some recent progress and applications in graph minor theory
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Choosability and fractional chromatic numbers
• The four-colour theorem
• Fractional colouring and Hadwiger's conjecture
• A note on not-4-list colorable planar graphs
• Connectivity and choosability of graphs with no \(K_t\) minor
• A refinement of choosability of graphs
• Über eine Eigenschaft der ebenen Komplexe
• Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
• Hadwiger’s Conjecture
• An extremal function for contractions of graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Improved lower bound for the list chromatic number of graphs with no K_t minor
• Girth and λ $\lambda $‐choosability of graphs

This page was built for publication: Refined List Version of Hadwiger’s Conjecture