Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418)
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 7622606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity and choosability of graphs with no \(K_t\) minor |
scientific article; zbMATH DE number 7622606 |
Statements
Connectivity and choosability of graphs with no \(K_t\) minor (English)
0 references
23 November 2022
0 references
graph minors
0 references
connectivity
0 references
list coloring
0 references
Hadwiger's conjecture
0 references
0 references
0.8660690188407898
0 references
0.863323450088501
0 references
0.820706307888031
0 references
0.816777765750885
0 references
0.8122403621673584
0 references
