Gauvain Devillez

19 papers C 1Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Knowledge management in House of Graphs.
CoRR
Gauvain Devillez, Sven D'hondt, Jan Goedgebeur
2026 J jnl
PHOEG: an online tool for discovery and education in extremal graph theory.
CoRR
Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot
2025 J jnl
ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices.
CoRR
Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Alain Hertz, Hadrien Mélot, David Schindl
2025 J jnl
Complete polyhedral description of chemical graphs of maximum degree at most 3.
CoRR
Valentin Dusollier, Sébastien Bonte, Gauvain Devillez, Alain Hertz, Hadrien Mélot, David Schindl
2025 J jnl
Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices.
CoRR
Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Alain Hertz, Hadrien Mélot
2024 J jnl
Extremal Chemical Graphs for the Arithmetic-Geometric Index.
CoRR
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl
2024 C conf
Incorporating a Database of Graphs into a Proof Assistant.
CICM
Andrej Bauer, Katja Bercic, Gauvain Devillez, Jure Taslak
2024 J jnl
The average size of maximal matchings in graphs.
J. Comb. Optim.
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
2023 J jnl
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph.
Discret. Appl. Math.
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
2023 J jnl
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph.
Graphs Comb.
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
2022 — —
Proofs by Transformation in Extremal Graph Theory.
Gauvain Devillez
2022 J jnl
The average size of maximal matchings in graphs.
CoRR
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
2021 J jnl
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph.
CoRR
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
2021 J jnl
Upper bounds on the average number of colors in the non-equivalent colorings of a graph.
CoRR
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
2019 J jnl
Maximum eccentric connectivity index for graphs with given diameter.
Discret. Appl. Math.
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
2018 J jnl
Maximum Eccentric Connectivity Index for Graphs with Given Diameter.
CoRR
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
2018 J jnl
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices.
CoRR
Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele
2018 — conf
PHOEG Helps to Obtain Extremal Graphsch: 32.
OR
Gauvain Devillez, Pierre Hauweele, Hadrien Mélot
2017 J jnl
PHOEG Helps Obtaining Extremal Graphs.
CoRR
Gauvain Devillez, Pierre Hauweele, Hadrien Mélot