Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Beyond Ohba's conjecture: a bound on the choice number of k-chromatic graphs with n vertices |
scientific article; zbMATH DE number 6352233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices |
scientific article; zbMATH DE number 6352233 |
Statements
Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (English)
0 references
8 October 2014
0 references
choosability
0 references
list chromatic number
0 references
0.89987046
0 references
0 references
0.8924748
0 references
0.8922872
0 references
0.8920941
0 references
0.88925886
0 references
0.8888664
0 references
0.88755757
0 references
