Ohba's conjecture is true for graphs with independence number at most three (Q1023085)
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: Ohba's conjecture is true for graphs with independence number at most three |
scientific article; zbMATH DE number 5563924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ohba's conjecture is true for graphs with independence number at most three |
scientific article; zbMATH DE number 5563924 |
Statements
Ohba's conjecture is true for graphs with independence number at most three (English)
0 references
10 June 2009
0 references
list coloring
0 references
chromatic-choosable
0 references
Ohba's conjecture
0 references
independence number
0 references
complete multipartite graphs
0 references
0.9143775701522828
0 references
0.8889816999435425
0 references
0.8810202479362488
0 references
0.87461918592453
0 references
