A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) |
scientific article |
Statements
A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (English)
0 references
20 December 2017
0 references
non-equivalent colorings
0 references
graphical Bell number
0 references
extremal theory
0 references
fixed maximum degree
0 references
