Hadrien Mélot

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 15

Top Topics

Maximal Cliques

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Publications

Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
The average size of maximal matchings in graphs. J. Comb. Optim. 47 (3) (2024)
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl
Extremal Chemical Graphs for the Arithmetic-Geometric Index. CoRR (2024)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph. Discret. Appl. Math. 335 (2023)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. Graphs Comb. 39 (3) (2023)
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
The average size of maximal matchings in graphs. CoRR (2022)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele
Upper bounds on the average number of colors in the non-equivalent colorings of a graph. CoRR (2021)
Alain Hertz, Anaelle Hertz, Hadrien Mélot
Using Graph Theory to Derive Inequalities for the Bell Numbers. CoRR (2021)
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph. CoRR (2021)
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
Maximum eccentric connectivity index for graphs with given diameter. Discret. Appl. Math. 268 (2019)
Gauvain Devillez, Pierre Hauweele, Hadrien Mélot
PHOEG Helps to Obtain Extremal Graphsch: 32. OR (2018)
Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree. Discret. Appl. Math. 234 (2018)
Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices. CoRR (2018)
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
Maximum Eccentric Connectivity Index for Graphs with Given Diameter. CoRR (2018)
Gauvain Devillez, Pierre Hauweele, Hadrien Mélot
PHOEG Helps Obtaining Extremal Graphs. CoRR (2017)
Alain Hertz, Hadrien Mélot
Counting the number of non-equivalent vertex colorings of a graph. Discret. Appl. Math. 203 (2016)
Romain Absil, Hadrien Mélot
On price of symmetrisation. CoRR (2013)
Romain Absil, Hadrien Mélot
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs CoRR (2013)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
House of Graphs: A database of interesting graphs. Discret. Appl. Math. 161 (1-2) (2013)
Véronique Bruyère, Gwenaël Joret, Hadrien Mélot
Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs Comb. 28 (2) (2012)
Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen
α-Labelings and the Structure of Trees with Nonzero α-Deficit. Discret. Math. Theor. Comput. Sci. 14 (1) (2012)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
House of Graphs: a database of interesting graphs CoRR (2012)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
A Database of Interesting Graphs: The House of Graphs. CTW (2012)
Véronique Bruyère, Hadrien Mélot
Fibonacci index and stability number of graphs: a polyhedral study. J. Comb. Optim. 18 (3) (2009)
Véronique Bruyère, Hadrien Mélot
Turán Graphs, Stability Number, and Fibonacci Index. COCOA (2008)
Véronique Bruyère, Hadrien Mélot
Turán Graphs, Stability Number, and Fibonacci Index CoRR (2008)
Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman
to uncover optimal relationships. Networks 52 (4) (2008)
Véronique Bruyère, Hadrien Mélot
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study CoRR (2008)
Hadrien Mélot
Facet defining inequalities among graph invariants: The system GraPHedron. Discret. Appl. Math. 156 (10) (2008)
Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
A Tight Analysis of the Maximal Matching Heuristic. COCOON (2005)
Ivan Gutman, Pierre Hansen, Hadrien Mélot
Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees. J. Chem. Inf. Model. 45 (2) (2005)
Pierre Hansen, Hadrien Mélot
Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index. J. Chem. Inf. Comput. Sci. 43 (1) (2003)
Pierre Hansen, Hadrien Mélot
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. Graphs and Discovery (2001)
Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic
What Forms Do Interesting Conjectures Have in Graph Theory? Graphs and Discovery (2001)