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)

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; Gauvain Devillez (Discret. Appl. Math., 2023)

Incorporating a Database of Graphs into a Proof Assistant. - Andrej Bauer; Katja Bercic; Gauvain Devillez; Jure Taslak (CICM, 2024)

Extremal Chemical Graphs for the Arithmetic-Geometric Index. - Alain Hertz; Sébastien Bonte; Gauvain Devillez; Valentin Dusollier; Hadrien Mélot; David Schindl (CoRR, 2024)

The average size of maximal matchings in graphs. - Alain Hertz; Sébastien Bonte; Gauvain Devillez; Hadrien Mélot (J. Comb. Optim., 2024)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices. - Sébastien Bonte; Gauvain Devillez; Valentin Dusollier; Alain Hertz; Hadrien Mélot (CoRR, 2025)

Complete polyhedral description of chemical graphs of maximum degree at most 3. - Valentin Dusollier; Sébastien Bonte; Gauvain Devillez; Alain Hertz; Hadrien Mélot; David Schindl (CoRR, 2025)