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


FD1 Graphs and Networks 4
June 11, 2021  2:45 PM
1 - GB Dantzig

Latest news

  • 6/5/21
    Conference abstract book

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.