Université de Mons
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 indu...BibTeX reference
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
We study the average number
\(A(G)\) of colors in the non-equivalent colorings of a graph
\(G\). We show some general properties of this graph invariant ...