Chromatic uniqueness of complete \(t\)-partite graphs \(K(n-k,n,\dots, n)\) (Q3403013)
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 5670010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic uniqueness of complete \(t\)-partite graphs \(K(n-k,n,\dots, n)\) |
scientific article; zbMATH DE number 5670010 |
Statements
12 February 2010
0 references
chromatically unique graph
0 references
characteristic subgraph
0 references
complete \(t\)-partite graph
0 references
chromatically equivalent
0 references
0.949507176876068
0 references
0.9438948035240172
0 references
0.9289309978485109
0 references
0.920358180999756
0 references
0.9178822636604308
0 references
