Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor (Q5886353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7671091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor |
scientific article; zbMATH DE number 7671091 |
Statements
Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor (English)
0 references
31 March 2023
0 references
list colouring
0 references
list chromatic number
0 references
choosability
0 references
graph minors
0 references
Hadwiger's conjecture
0 references
0.8660690188407898
0 references
0.8401755094528198
0 references
0.8352444767951965
0 references
0.815778911113739
0 references
0.8150511980056763
0 references
