Hadrien Mélot

37 papers C 2Misc 1Journal 31Unranked 3
YearRankTypeTitle / Venue / Authors
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 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 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
2021 J jnl
Using Graph Theory to Derive Inequalities for the Bell Numbers.
CoRR
Alain Hertz, Anaelle Hertz, Hadrien Mélot
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
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.
Discret. Appl. Math.
Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot
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
2016 J jnl
Counting the number of non-equivalent vertex colorings of a graph.
Discret. Appl. Math.
Alain Hertz, Hadrien Mélot
2013 J jnl
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs
CoRR
Romain Absil, Hadrien Mélot
2013 J jnl
House of Graphs: A database of interesting graphs.
Discret. Appl. Math.
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
2013 J jnl
On price of symmetrisation.
CoRR
Romain Absil, Hadrien Mélot
2012 C conf
A Database of Interesting Graphs: The House of Graphs.
CTW
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
2012 J jnl
House of Graphs: a database of interesting graphs
CoRR
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
2012 J jnl
Trees with Given Stability Number and Minimum Number of Stable Sets.
Graphs Comb.
Véronique Bruyère, Gwenaël Joret, Hadrien Mélot
2012 J jnl
α-Labelings and the Structure of Trees with Nonzero α-Deficit.
Discret. Math. Theor. Comput. Sci.
Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen
2009 J jnl
Fibonacci index and stability number of graphs: a polyhedral study.
J. Comb. Optim.
Véronique Bruyère, Hadrien Mélot
2008 J jnl
Facet defining inequalities among graph invariants: The system GraPHedron.
Discret. Appl. Math.
Hadrien Mélot
2008 J jnl
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
CoRR
Véronique Bruyère, Hadrien Mélot
2008 J jnl
Linear inequalities among graph invariants: Using
Networks
Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman
2008 J jnl
Turán Graphs, Stability Number, and Fibonacci Index
CoRR
Véronique Bruyère, Hadrien Mélot
2008 C conf
Turán Graphs, Stability Number, and Fibonacci Index.
COCOA
Véronique Bruyère, Hadrien Mélot
2005 Misc conf
A Tight Analysis of the Maximal Matching Heuristic.
COCOON
Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
2005 J jnl
Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees.
J. Chem. Inf. Model.
Ivan Gutman, Pierre Hansen, Hadrien Mélot
2003 J jnl
Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index.
J. Chem. Inf. Comput. Sci.
Pierre Hansen, Hadrien Mélot
2001 — conf
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph.
Graphs and Discovery
Pierre Hansen, Hadrien Mélot
2001 — conf
What Forms Do Interesting Conjectures Have in Graph Theory?
Graphs and Discovery
Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic