About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\) (Q2630541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6607064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\) |
scientific article; zbMATH DE number 6607064 |
Statements
About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\) (English)
0 references
28 July 2016
0 references
chromatic polynomial
0 references
chromatic uniqueness
0 references
complete tripartite graph
0 references
0.9683012962341307
0 references
0.9475358724594116
0 references
0.945765495300293
0 references
0.9401313066482544
0 references
0.9395992159843444
0 references
