| On the defect of vertex-transitive graphs of given degree and diameter. | 0 | 0.34 | 2019 |
| Bounds for the smallest k-chromatic graphs of given girth. | 0 | 0.34 | 2018 |
| Biregular Cages of Odd Girth | 0 | 0.34 | 2016 |
| Small bi-regular graphs of even girth | 0 | 0.34 | 2016 |
| New Lower Bounds for 28 Classical Ramsey Numbers | 0 | 0.34 | 2015 |
| On Some Small Classical Ramsey Numbers. | 1 | 0.40 | 2013 |
| Recursive constructions of small regular graphs of given degree and girth. | 2 | 0.51 | 2012 |
| Radial Moore graphs of radius three | 3 | 0.51 | 2012 |
| On the Ramsey Number R(4, 6). | 2 | 0.39 | 2012 |
| Locating-Dominating Codes In Cycles | 0 | 0.34 | 2011 |
| Locating-dominating codes in paths | 2 | 0.40 | 2011 |
| On the girth of voltage graph lifts | 3 | 0.44 | 2011 |
| Computational determination of (3,11) and (4,7) cages | 5 | 0.59 | 2011 |
| Ranking measures for radially Moore graphs | 4 | 0.57 | 2010 |
| Improved bounds on identifying codes in binary Hamming spaces | 8 | 0.55 | 2010 |
| On the limitations of the use of solvable groups in Cayley graph cage constructions | 5 | 0.64 | 2010 |
| Upper bounds for binary identifying codes | 3 | 0.46 | 2009 |
| Properties of Groups for the Cage and Degree/Diameter Problems | 0 | 0.34 | 2009 |
| New bounds on binary identifying codes | 11 | 0.76 | 2008 |
| Improved bounds on binary identifying codes | 0 | 0.34 | 2008 |
| Epsilon-Unit Distance Graphs | 0 | 0.34 | 2005 |
| Voltage Graphs, Group Presentations and Cages | 5 | 0.62 | 2004 |
| Constructive Lower Bounds on Classical Multicolor Ramsey Numbers | 8 | 0.95 | 2004 |
| Some applications of pq-groups in graph theory. | 1 | 0.59 | 2004 |
| A Euclidean Ramsey Problem | 2 | 0.66 | 2003 |
| A Small Trivalent Graph of Girth 14 | 2 | 0.57 | 2002 |
| Totally magic graphs | 6 | 1.00 | 2002 |
| A trivalent graph of girth 17. | 0 | 0.34 | 2001 |
| A family of graphs and the degree-diameter problem | 3 | 0.44 | 2001 |
| Some New Ramsey Colorings | 7 | 1.60 | 1998 |
| A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16 | 10 | 0.76 | 1996 |
| A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers | 10 | 1.14 | 1994 |
| On set systems not containing delta systems | 1 | 0.44 | 1992 |
| A bipartite Ramsey number. | 3 | 0.52 | 1991 |
| Three color Ramsey number of K4—e | 1 | 0.37 | 1991 |
| A lower bound for r(5, 5) | 4 | 0.77 | 1989 |
| Ramsey numbers based on C5-decompositions | 1 | 0.63 | 1988 |
| On line disjoint paths of bounded length | 11 | 0.68 | 1983 |
| The smallest 2-connected cubic bipartite planar nonhamiltonian graph | 4 | 0.45 | 1982 |
| On A Measure Of Communication-Network Vulnerability | 7 | 1.80 | 1982 |
| A counterexample to a conjecture on paths of bounded length | 9 | 1.57 | 1982 |
| Covering And Packing In Graphs .4. Linear Arboricity | 32 | 12.31 | 1981 |
| Further results on graph equations for line graphs and n-th power graphs | 3 | 0.54 | 1981 |
| On an adjacency property of graphs. | 3 | 0.59 | 1981 |
| The smallest graphs with certain adjacency properties | 5 | 1.25 | 1980 |
