par Absil, Romain;Camby, Eglantine
;Hertz, Alain;Melot, Hadrien ![](/vufind/images/ULB/publications_list.png)
Référence Discrete applied mathematics, 234, page (3-11)
Publication Publié, 2018-01
![](/vufind/images/ULB/publications_list.png)
![](/vufind/images/ULB/publications_list.png)
Référence Discrete applied mathematics, 234, page (3-11)
Publication Publié, 2018-01
Article révisé par les pairs
Résumé : | Two vertex colorings of a graph G are equivalent if they induce the same partition of the vertex set into color classes. The graphical Bell number B(G) is the number of non-equivalent vertex colorings of G. We determine a sharp lower bound on B(G) for graphs G of order n and maximum degree n−3, and we characterize the graphs for which the bound is attained. |