New upper bounds for the chromatic number of a graph (Q2707978)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1584478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper bounds for the chromatic number of a graph |
scientific article; zbMATH DE number 1584478 |
Statements
21 October 2001
0 references
chromatic number
0 references
maximum degree
0 references
Brooks' theorem
0 references
0 references
New upper bounds for the chromatic number of a graph (English)
0 references
0.8244149088859558
0 references
0.8187215328216553
0 references
0.8113811612129211
0 references
