An algorithm for obtaining the chromatic number and an optimal coloring of a graph (Q2264680)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for obtaining the chromatic number and an optimal coloring of a graph |
scientific article; zbMATH DE number 3430692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for obtaining the chromatic number and an optimal coloring of a graph |
scientific article; zbMATH DE number 3430692 |
Statements
An algorithm for obtaining the chromatic number and an optimal coloring of a graph (English)
0 references
1973
0 references
