G. Devillez, A. Hertz, H. Mélot, S. Bonte, P. Hauweele
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\avcol(G)$ be the average number of colors in the non-equivalent colorings of a graph $G$. We give properties and state open problems of this recently defined graph invariant.
Keywords: Graph coloring, Average number of colors, Graphical Bell numbers
Scheduled
FD1 Graphs and Networks 4
June 11, 2021 2:45 PM
1 - GB Dantzig
