Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs (Q461058)
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 6353230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs |
scientific article; zbMATH DE number 6353230 |
Statements
Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs (English)
0 references
9 October 2014
0 references
integer partition
0 references
lattice
0 references
complete multipartite graph
0 references
chromatic polynomial
0 references
chromatic uniqueness
0 references
0.92139524
0 references
0.92024714
0 references
0.92024714
0 references
0.91827524
0 references
0 references
0.91558045
0 references
0.91508555
0 references
0.91460013
0 references
