9 citations · 10 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Upper bounds on the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +2
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 o…
math.CO2021★ 1 cited
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +1
We study the average number of colors in the non-equivalent colorings of a graph . We show some general properties of this graph invariant and determine its val…