2 citations · 3 across the 4 of their papers we have counts for
4 papers
The average size of maximal matchings in graphs
Alain Hertz, Sébastien Bonte, Gauvain Devillez +1
We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph . If many maximal matchings have a size close to $\maxM…
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…
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…
Using Graph Theory to Derive Inequalities for the Bell Numbers
Alain Hertz, Anaelle Hertz, Hadrien Mélot
The Bell numbers count the number of different ways to partition a set of elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex…