Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Extremal Graph Theory;Bollobás,1978
2. Graph Theory;Diestel,1997
3. Choosability in graphs;Erdo˝s,1979
4. Über einen Satz von K. Wagner zum Vierfarbenproblem;Halin;Math. Ann.,1964
5. Every planar graph is 5-choosable;Thomassen;J. Combin. Theory Ser. B,1994
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the choosability of -minor-free graphs;Combinatorics, Probability and Computing;2023-11-03
2. Local Hadwiger's Conjecture;Journal of Combinatorial Theory, Series B;2023-09
3. An extension of Thomassen’s result on choosability;Applied Mathematics and Computation;2022-07
4. Improved lower bound for the list chromatic number of graphs with no Kt minor;Combinatorics, Probability and Computing;2022-05-30
5. The Alon-Tarsi number of K5-minor-free graphs;Discrete Mathematics;2022-04