Counting the number of non-equivalent vertex colorings of a graph (Q260025)
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: Counting the number of non-equivalent vertex colorings of a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting the number of non-equivalent vertex colorings of a graph |
scientific article |
Statements
Counting the number of non-equivalent vertex colorings of a graph (English)
0 references
18 March 2016
0 references
non-equivalent colorings
0 references
graphical Bell numbers
0 references
chromatic polynomial
0 references
