Gauvain Devillez

According to our database, Gauvain Devillez authored at least 8 papers between 2017 and 2024.

Collaborative distances:

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

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

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

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