An upper bound for the chromatic number of a graph and its application to timetabling problems (Q5524918)
From MaRDI portal
scientific article; zbMATH DE number 3237382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the chromatic number of a graph and its application to timetabling problems |
scientific article; zbMATH DE number 3237382 |
Statements
An upper bound for the chromatic number of a graph and its application to timetabling problems (English)
0 references
1967
0 references
numerical analysis
0 references
