Gauvain Devillez

Orcid: 0000-0002-3931-1610

According to our database¹, Gauvain Devillez authored at least 11 papers between 2017 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Complete polyhedral description of chemical graphs of maximum degree at most 3.

[BibT_eX]

[DOI]

CoRR, June, 2025

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices.

[BibT_eX]

[DOI]

CoRR, January, 2025

2024

The average size of maximal matchings in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., April, 2024

Extremal Chemical Graphs for the Arithmetic-Geometric Index.

[BibT_eX]

[DOI]

CoRR, 2024

Incorporating a Database of Graphs into a Proof Assistant.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - 17th International Conference, 2024

2023

Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., August, 2023

Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph.

[BibT_eX]

[DOI]

Graphs Comb., June, 2023

2019

Maximum eccentric connectivity index for graphs with given diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices.

[BibT_eX]

[DOI]

CoRR, 2018

PHOEG Helps to Obtain Extremal Graphsch: 32.

[BibT_eX]

[DOI]

Gauvain Devillez

Pierre Hauweele

Hadrien Mélot

Proceedings of the Operations Research Proceedings 2018, 2018

2017

PHOEG Helps Obtaining Extremal Graphs.

[BibT_eX]

[DOI]

Gauvain Devillez

Pierre Hauweele

Hadrien Mélot

CoRR, 2017

Gauvain Devillez

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...