A new upper bound for the chromatic number of a graph (Q5444063): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q228794 |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.7151/dmgt.1350 / rank | |||
| Property / author | |||
| Property / author: Ingo Schiermeyer / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054104670 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.7151/DMGT.1350 / rank | |||
Normal rank | |||
Latest revision as of 17:01, 30 December 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
