Hadrien Mélot
Hadrien Mélot
Verified email at
Cited by
Cited by
House of Graphs: a database of interesting graphs
G Brinkmann, K Coolsaet, J Goedgebeur, H Mélot
Discrete Applied Mathematics 161 (1-2), 311-314, 2013
Variable neighborhood search for extremal graphs. 10. Comparison of irregularity indices for chemical trees
I Gutman, P Hansen, H Mélot
Journal of chemical information and modeling 45 (2), 222-230, 2005
Variable neighborhood search for extremal graphs 9: Bounding the irregularity of a graph
P Hansen, H Mélot
Groupe d'études et de recherche en analyse des décisions, 2002
Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index
P Hansen, H Mélot
Journal of chemical information and computer sciences 43 (1), 1-14, 2003
Facet defining inequalities among graph invariants: the system GraPHedron
H Mélot
Discrete Applied Mathematics 156 (10), 1875-1891, 2008
Variable Neighborhood Search for Extremals Graphs 12. A Note on the Variance of Bounded Degrees in Graphs
P Hansen, H Mélot, I Gutman
MATCH Communications in Mathematical and in Computer Chemistry 54, 2005
A tight analysis of the maximal matching heuristic
J Cardinal, M Labbé, S Langerman, E Levy, H Mélot
International Computing and Combinatorics Conference, 701-709, 2005
Integral complete split graphs
P Hansen, H Mélot, D Stevanović
Publikacije Elektrotehničkog fakulteta. Serija Matematika, 89-95, 2002
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
J Christophe, S Dewez, JP Doignon, G Fasbender, P Grégoire, ...
Networks: An International Journal 52 (4), 287-298, 2008
Computers and discovery in algebraic graph theory
P Hansen, H Mélot
Linear algebra and its applications 356 (1-3), 211-230, 2002
What forms do interesting conjectures have in graph theory?
P Hansen, M Aouchiche, G Caporossi, H Melot, D Stevanovic
Dimacs series in discrete mathematics and theoretical computer science 69, 231, 2005
Counting the number of non-equivalent vertex colorings of a graph
A Hertz, H Mélot
Discrete Applied Mathematics 203, 62-71, 2016
Fibonacci index and stability number of graphs: a polyhedral study
V Bruyère, H Mélot
Journal of combinatorial optimization 18, 207-228, 2009
PHOEG Helps to Obtain Extremal Graphs
G Devillez, P Hauweele, H Mélot
Operations Research Proceedings 2018: Selected Papers of the Annual …, 2019
Maximum eccentric connectivity index for graphs with given diameter
P Hauweele, A Hertz, H Mélot, B Ries, G Devillez
Discrete Applied Mathematics 268, 102-111, 2019
A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n− 3
R Absil, E Camby, A Hertz, H Mélot
Discrete applied mathematics 234, 3-11, 2018
alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit
G Brinkmann, S Crevals, H Mélot, L Rylands, E Steffen
Discrete Mathematics & Theoretical Computer Science 14 (Graph Theory), 2012
Trees with given stability number and minimum number of stable sets
V Bruyère, G Joret, H Mélot
Graphs and combinatorics 28 (2), 167-187, 2012
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs
R Absil, H Mélot
arXiv preprint arXiv:1304.7993, 2013
Turàn graphs, stability number, and Fibonacci index
V Bruyere, H Mélot
International Conference on Combinatorial Optimization and Applications, 127-138, 2008
The system can't perform the operation now. Try again later.
Articles 1–20