| A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree. | 0 | 0.34 | 2018 |
| Maximum Eccentric Connectivity Index for Graphs with Given Diameter. | 0 | 0.34 | 2018 |
| PHOEG Helps to Obtain Extremal Graphsch - 32. | 0 | 0.34 | 2018 |
| Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices. | 0 | 0.34 | 2018 |
| PHOEG Helps Obtaining Extremal Graphs. | 0 | 0.34 | 2017 |
| Counting the number of non-equivalent vertex colorings of a graph | 0 | 0.34 | 2016 |
| Digenes: genetic algorithms to discover conjectures about directed and undirected graphs | 1 | 0.48 | 2013 |
| On price of symmetrisation. | 0 | 0.34 | 2013 |
| House of Graphs: a database of interesting graphs | 13 | 1.11 | 2013 |
| A Database of Interesting Graphs: The House of Graphs. | 0 | 0.34 | 2012 |
| Trees with Given Stability Number and Minimum Number of Stable Sets | 1 | 0.37 | 2012 |
| α-Labelings and the Structure of Trees with Nonzero α-Deficit. | 1 | 0.39 | 2012 |
| Fibonacci index and stability number of graphs: a polyhedral study | 0 | 0.34 | 2009 |
| Facet defining inequalities among graph invariants: The system GraPHedron | 14 | 0.88 | 2008 |
| Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships | 7 | 1.04 | 2008 |
| Turán Graphs, Stability Number, and Fibonacci Index | 0 | 0.34 | 2008 |
| Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees. | 12 | 1.02 | 2005 |
| A tight analysis of the maximal matching heuristic | 11 | 0.80 | 2005 |
| Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index. | 15 | 2.82 | 2003 |
| Variable Neighborhood Search For Extremal Graphs. 9. Bounding The Irregularity Of A Graph | 16 | 1.19 | 2001 |
| What Forms Do Interesting Conjectures Have in Graph Theory ? | 4 | 0.52 | 2001 |
