Sébastien Bonte

According to our database, Sébastien Bonte authored at least 8 papers between 2023 and 2026.

Collaborative distances:

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

2026

PHOEG: an online tool for discovery and education in extremal graph theory.

Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot

CoRR, March, 2026

2025

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices.

Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Alain Hertz, Hadrien Mélot, David Schindl

CoRR, November, 2025

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

Valentin Dusollier, Sébastien Bonte, Gauvain Devillez, Alain Hertz, Hadrien Mélot, David Schindl

CoRR, June, 2025

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

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

CoRR, January, 2025

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