PHOEG Helps Obtaining Extremal Graphs. - Gauvain Devillez; Pierre Hauweele; Hadrien Mélot (CoRR, 2017)

PHOEG Helps to Obtain Extremal Graphsch: 32. - Gauvain Devillez; Pierre Hauweele; Hadrien Mélot (OR, 2018)

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices. - Gauvain Devillez; Alain Hertz; Hadrien Mélot; Pierre Hauweele (CoRR, 2018)

Maximum eccentric connectivity index for graphs with given diameter. - Pierre Hauweele; Alain Hertz; Hadrien Mélot; Bernard Ries; Gauvain Devillez (Discret. Appl. Math., 2019)

Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. - Alain Hertz; Hadrien Mélot; Sébastien Bonte; Gauvain Devillez; Pierre Hauweele (Graphs Comb., 2023)