Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (Q998482)
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: Choice number of complete multipartite graphs K₃*3,2*(k - 5),1*2 and K₄,3*2,2*(k - 6),1*3 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) |
scientific article |
Statements
Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (English)
0 references
28 January 2009
0 references
list coloring
0 references
complete multipartite graphs
0 references
chromatic choosable graphs
0 references
Ohba's conjecture
0 references
0.9621862769126892
0 references
0.9619455933570862
0 references
0.9568983912467957
0 references
0.9425640106201172
0 references
0.8892449736595154
0 references
