Author:
Barát János,Joret Gwenaël,Wood David R.
Abstract
The List Hadwiger Conjecture asserts that every $K_t$-minor-free graph is $t$-choosable. We disprove this conjecture by constructing a $K_{3t+2}$-minor-free graph that is not $4t$-choosable for every integer $t\geq 1$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the choosability of -minor-free graphs;Combinatorics, Probability and Computing;2023-11-03
2. Refined List Version of Hadwiger’s Conjecture;SIAM Journal on Discrete Mathematics;2023-08-09
3. Refined list version of Hadwiger’s Conjecture;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. Improved lower bound for the list chromatic number of graphs with no Kt minor;Combinatorics, Probability and Computing;2022-05-30
5. Defective Colouring of Graphs Excluding A Subgraph or Minor;Combinatorica;2018-08-14