Ore's conjecture on color-critical graphs is almost true (Q462926)
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: Ore's conjecture on color-critical graphs is almost true |
scientific article; zbMATH DE number 6359844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ore's conjecture on color-critical graphs is almost true |
scientific article; zbMATH DE number 6359844 |
Statements
Ore's conjecture on color-critical graphs is almost true (English)
0 references
22 October 2014
0 references
graph coloring
0 references
\(k\)-critical graphs
0 references
sparse graphs
0 references
0 references
0.8741852
0 references
0.8658906
0 references
0.86479014
0 references
0.8645234
0 references
0.86431694
0 references
0.86345845
0 references
