A new method to find out the chromatic partition of a symmetric graph (Q4186345)
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: A new method to find out the chromatic partition of a symmetric graph |
scientific article; zbMATH DE number 3623589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new method to find out the chromatic partition of a symmetric graph |
scientific article; zbMATH DE number 3623589 |
Statements
A new method to find out the chromatic partition of a symmetric graph (English)
0 references
1978
0 references
Chromatic Partition
0 references
Symmetric Graph
0 references
Two-Stage Algorithm
0 references
Maximal Linearly Independent Subsets
0 references
Chromatic Number
0 references
Minimal Covering Collection
0 references
