About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\) (Q2630541): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:22, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\) |
scientific article |
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
