Hadrien Mélot

According to our database, Hadrien Mélot authored at least 26 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The average size of maximal matchings in graphs.

Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot

J. Comb. Optim., April, 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

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., August, 2023

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., June, 2023

2021

Using Graph Theory to Derive Inequalities for the Bell Numbers.

Alain Hertz, Anaelle Hertz, Hadrien Mélot

CoRR, 2021

2019

Maximum eccentric connectivity index for graphs with given diameter.

Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez

Discret. Appl. Math., 2019

2018

A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.

Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot

Discret. Appl. Math., 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

PHOEG Helps to Obtain Extremal Graphsch: 32.

Gauvain Devillez, Pierre Hauweele, Hadrien Mélot

Proceedings of the Operations Research Proceedings 2018, 2018

2017

PHOEG Helps Obtaining Extremal Graphs.

Gauvain Devillez, Pierre Hauweele, Hadrien Mélot

CoRR, 2017

2016

Counting the number of non-equivalent vertex colorings of a graph.

Alain Hertz, Hadrien Mélot

Discret. Appl. Math., 2016

2013

House of Graphs: A database of interesting graphs.

Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot

Discret. Appl. Math., 2013

Digenes: genetic algorithms to discover conjectures about directed and undirected graphs

Romain Absil, Hadrien Mélot

CoRR, 2013

On price of symmetrisation.

Romain Absil, Hadrien Mélot

CoRR, 2013

2012

Trees with Given Stability Number and Minimum Number of Stable Sets.

Véronique Bruyère, Gwenaël Joret, Hadrien Mélot

Graphs Comb., 2012

α-Labelings and the Structure of Trees with Nonzero α-Deficit.

Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen

Discret. Math. Theor. Comput. Sci., 2012

A Database of Interesting Graphs: The House of Graphs.

Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2009

Fibonacci index and stability number of graphs: a polyhedral study.

Véronique Bruyère, Hadrien Mélot

J. Comb. Optim., 2009

2008

Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships.

Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman

Networks, 2008

Facet defining inequalities among graph invariants: The system GraPHedron.

Hadrien Mélot

Discret. Appl. Math., 2008

Turán Graphs, Stability Number, and Fibonacci Index.

Véronique Bruyère, Hadrien Mélot

Proceedings of the Combinatorial Optimization and Applications, 2008

2005

Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees.

Ivan Gutman, Pierre Hansen, Hadrien Mélot

J. Chem. Inf. Model., 2005

A Tight Analysis of the Maximal Matching Heuristic.

Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2003

Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index.

Pierre Hansen, Hadrien Mélot

J. Chem. Inf. Comput. Sci., 2003

2001

Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph.

Pierre Hansen, Hadrien Mélot

Proceedings of the Graphs and Discovery, 2001

What Forms Do Interesting Conjectures Have in Graph Theory?

Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic

Proceedings of the Graphs and Discovery, 2001