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 the normal view instead:
scientific article; zbMATH DE number 6558408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting the number of non-equivalent vertex colorings of a graph |
scientific article; zbMATH DE number 6558408 |
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
0.9190524220466614
0 references
0.8481305837631226
0 references
0.8427514433860779
0 references
0.8137381672859192
0 references
