Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396)
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: Coloring a graph with -1 colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker |
scientific article |
Statements
Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (English)
0 references
19 November 2014
0 references
0 references
0.8553410172462463
0 references
0.8552764058113098
0 references
0.8288264274597168
0 references
0.8040280342102051
0 references
0.7867391109466553
0 references
