The following pages link to Hadrien Mélot (Q260024):
Displaying 22 items.
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- Fibonacci index and stability number of graphs: a polyhedral study (Q1041432) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- House of Graphs: a database of interesting graphs (Q1759891) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Trees with given stability number and minimum number of stable sets (Q1926055) (← links)
- Maximum eccentric connectivity index for graphs with given diameter (Q2274082) (← links)
- Integral complete split graphs (Q3369068) (← links)
- Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices (Q3388428) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
- (Q4928216) (← links)
- (Q5026930) (← links)
- (Q5403021) (← links)
- (Q5477963) (← links)
- (Q5477964) (← links)
- Turán Graphs, Stability Number, and Fibonacci Index (Q5505651) (← links)
- Computing and Combinatorics (Q5716992) (← links)
- Upper bounds on the average number of colors in the non-equivalent colorings of a graph (Q6045131) (← links)
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)
- The average size of maximal matchings in graphs (Q6497032) (← links)
- Extremal Chemical Graphs for the Arithmetic-Geometric Index (Q6525213) (← links)
