Sébastien Bonte

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

Collaborative distances:

• Dijkstra number of five.
• 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