Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663)
From MaRDI portal
!
WARNING
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 5300661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Another proof of the 5-choosability of \(K_5\)-minor-free graphs |
scientific article; zbMATH DE number 5300661 |
Statements
Another proof of the 5-choosability of \(K_5\)-minor-free graphs (English)
0 references
11 July 2008
0 references
list coloring
0 references
choosability
0 references
Wagner graph
0 references
\(K_5\)-minor-free
0 references
planar graph
0 references
0.9560611248016356
0 references
0.9560611248016356
0 references
0.8881920576095581
0 references
0.8861603140830994
0 references
0.8362352848052979
0 references
