57. Bounds on the number of non-equivalent colorings of a graph
Invited abstract in session FC-1: Graphs, stream Graphs.
Friday, 13:30 - 15:00Room: L226
Authors (first author is the speaker)
| 1. | Valentin Dusollier
|
| Algorithms Lab, Computer Science, UMONS | |
| 2. | Alain Hertz
|
| Polytechnique Montreal and GERAD | |
| 3. | Hadrien Mélot
|
| Algorithms Lab, Computer Science, UMONS |
Abstract
We will focus on bounds on the number of non-equivalent colorings of a graph, also known as the graphical Bell number. This number counts the possible partitions of a set with some constraints given by the graph structure. We give both lower and upper bounds for graphs with fixed order and size, as well as those with fixed order and diameter.
Keywords
- Graph theory and networks
Status: accepted
Back to the list of papers