A comparison of bounds for the chromatic number of a graph (Q1159685): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5782525 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Eigenvalues of a Graph and Its Chromatic Number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An inequality for the chromatic number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The preparation of examination time-tables using a small-store computer / rank | |||
Normal rank | |||
Latest revision as of 14:31, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of bounds for the chromatic number of a graph |
scientific article |
Statements
A comparison of bounds for the chromatic number of a graph (English)
0 references
1981
0 references
chromatic number
0 references
adjacency matrix
0 references
0 references
