Algorithms for finding in the lump both bounds of the chromatic number of a graph (Q4109290): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/comjnl/19.4.329 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162274057 / rank | |||
Normal rank | |||
Latest revision as of 21:06, 19 March 2024
scientific article; zbMATH DE number 3532517
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for finding in the lump both bounds of the chromatic number of a graph |
scientific article; zbMATH DE number 3532517 |
Statements
Algorithms for finding in the lump both bounds of the chromatic number of a graph (English)
0 references
1976
0 references
