Algorithms for finding in the lump both bounds of the chromatic number of a graph (Q4109290): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 07:34, 6 February 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