A new upper bound for the chromatic number of a graph (Q5444063): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:38, 9 February 2024
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
