default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHadrien Mélot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Alain Hertz
, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot:
The average size of maximal matchings in graphs. J. Comb. Optim. 47(3): 46 (2024)- [i13]Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl:
Extremal Chemical Graphs for the Arithmetic-Geometric Index. CoRR abs/2403.05226 (2024) - 2023
- [j13]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: 69-81 (2023) - [j12]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): 49 (2023) - 2022
- [i12]Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot:
The average size of maximal matchings in graphs. CoRR abs/2204.10236 (2022) - 2021
- [i11]Alain Hertz, Anaelle Hertz, Hadrien Mélot:
Using Graph Theory to Derive Inequalities for the Bell Numbers. CoRR abs/2104.00552 (2021) - [i10]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 abs/2104.14172 (2021) - [i9]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 abs/2105.01120 (2021)
2010 – 2019
- 2019
- [j11]Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez:
Maximum eccentric connectivity index for graphs with given diameter. Discret. Appl. Math. 268: 102-111 (2019) - 2018
- [j10]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: 3-11 (2018) - [c6]Gauvain Devillez, Pierre Hauweele, Hadrien Mélot:
PHOEG Helps to Obtain Extremal Graphsch: 32. OR 2018: 251-257 - [i8]Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez:
Maximum Eccentric Connectivity Index for Graphs with Given Diameter. CoRR abs/1808.10203 (2018) - [i7]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 abs/1809.03158 (2018) - 2017
- [i6]Gauvain Devillez, Pierre Hauweele, Hadrien Mélot:
PHOEG Helps Obtaining Extremal Graphs. CoRR abs/1712.07861 (2017) - 2016
- [j9]Alain Hertz, Hadrien Mélot:
Counting the number of non-equivalent vertex colorings of a graph. Discret. Appl. Math. 203: 62-71 (2016) - 2013
- [j8]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: A database of interesting graphs. Discret. Appl. Math. 161(1-2): 311-314 (2013) - [i5]Romain Absil, Hadrien Mélot:
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs. CoRR abs/1304.7993 (2013) - [i4]Romain Absil, Hadrien Mélot:
On price of symmetrisation. CoRR abs/1310.2775 (2013) - 2012
- [j7]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): 159-174 (2012) - [j6]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): 167-187 (2012) - [c5]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
A Database of Interesting Graphs: The House of Graphs. CTW 2012: 36-39 - [i3]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: a database of interesting graphs. CoRR abs/1204.3549 (2012)
2000 – 2009
- 2009
- [j5]Véronique Bruyère, Hadrien Mélot:
Fibonacci index and stability number of graphs: a polyhedral study. J. Comb. Optim. 18(3): 207-228 (2009) - 2008
- [j4]Hadrien Mélot:
Facet defining inequalities among graph invariants: The system GraPHedron. Discret. Appl. Math. 156(10): 1875-1891 (2008) - [j3]Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman:
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008) - [c4]Véronique Bruyère, Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index. COCOA 2008: 127-138 - [i2]Véronique Bruyère, Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index. CoRR abs/0802.3284 (2008) - [i1]Véronique Bruyère, Hadrien Mélot:
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study. CoRR abs/0811.1449 (2008) - 2005
- [j2]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): 222-230 (2005) - [c3]Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot:
A Tight Analysis of the Maximal Matching Heuristic. COCOON 2005: 701-709 - 2003
- [j1]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): 1-14 (2003) - 2001
- [c2]Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic:
What Forms Do Interesting Conjectures Have in Graph Theory? Graphs and Discovery 2001: 231-251 - [c1]Pierre Hansen, Hadrien Mélot:
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. Graphs and Discovery 2001: 253-264
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
