Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant

DOI10.1016/j.jctb.2022.02.002zbMath1494.05049arXiv2109.02302OpenAlexW3198262761MaRDI QIDQ2131858

Yanyan Li

Publication date: 27 April 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringgraph minorchromatic numberHadwiger's conjectureodd minor

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Improved bound for improper colourings of graphs with no odd clique minor

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bound of the Hadwiger number of graphs by their average degree
• Some remarks on the odd Hadwiger's conjecture
• Note on coloring graphs without odd-\(K_k\)-minors
• 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
• Fractional coloring and the odd Hadwiger's conjecture
• On the odd-minor variant of Hadwiger's conjecture
• Über eine Eigenschaft der ebenen Komplexe
• Hadwiger’s Conjecture
• An extremal function for contractions of graphs
• A Weakening of the Odd Hadwiger's Conjecture
• Improper colouring of graphs with no odd clique minor
• The Graph Minor Algorithm with Parity Conditions

This page was built for publication: Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant