The use of the chromatic polynomial of a graph in enumerative combinatorics (Q2922717)
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: The use of the chromatic polynomial of a graph in enumerative combinatorics |
scientific article; zbMATH DE number 6355428
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The use of the chromatic polynomial of a graph in enumerative combinatorics |
scientific article; zbMATH DE number 6355428 |
Statements
14 October 2014
0 references
partition
0 references
Bell number
0 references
Stirling number
0 references
chromatic polynomial
0 references
The use of the chromatic polynomial of a graph in enumerative combinatorics (English)
0 references
