A new upper bound for the chromatic number of a graph (Q5444063)
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: A new upper bound for the chromatic number of a graph |
scientific article; zbMATH DE number 5238502
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound for the chromatic number of a graph |
scientific article; zbMATH DE number 5238502 |
Statements
A new upper bound for the chromatic number of a graph (English)
0 references
22 February 2008
0 references
vertex colouring
0 references
chromatic number upper bound
0 references
clique number
0 references
