2 results
On the choosability of $H$-minor-free graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 33 / Issue 2 / March 2024
- Published online by Cambridge University Press:
- 03 November 2023, pp. 129-142
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Improved lower bound for the list chromatic number of graphs with no Kt minor
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 31 / Issue 6 / November 2022
- Published online by Cambridge University Press:
- 30 May 2022, pp. 1070-1075
-
- Article
-
- You have access
- Open access
- HTML
- Export citation