| Forbidden subgraphs that imply hamiltonian-connectedness | 1 | 0.37 | 2002 |
| Long cycles in 3-cyclable graphs | 0 | 0.34 | 2000 |
| Not every 2-tough graph is Hamiltonian | 31 | 2.09 | 2000 |
| Chrodality and 2-factors in tough graphs | 7 | 0.50 | 2000 |
| Pancyclicity of claw-free hamiltonian graphs | 4 | 0.71 | 1999 |
| Toughness and longest cycles in 2-connected planar graphs | 1 | 0.35 | 1996 |
| A note on dominating cycles in 2-connected graphs | 3 | 1.20 | 1996 |
| On graphs satisfying a local Ore-type condition | 4 | 0.75 | 1996 |
| Hamiltonicity of regular 2-connected graphs | 5 | 0.53 | 1996 |
| Pancyclicity of Hamiltonian line graphs | 9 | 1.20 | 1995 |
| Long cycles in graphs with prescribed toughness and minimum degree | 14 | 2.35 | 1995 |
| On dominating and spanning circuits in graphs | 10 | 0.96 | 1994 |
| A generalization of Ore's theorem involving neighborhood unions | 11 | 0.97 | 1993 |
| Long paths and cycles in tough graphs | 5 | 0.65 | 1993 |
| Decomposition Of Bipartite Graphs Under Degree Constraints | 1 | 0.35 | 1993 |
| Long cycles, degree sums and neighborhood unions | 7 | 0.99 | 1993 |
| Cycles containing all vertices of maximum degree | 1 | 0.41 | 1993 |
| Cycles containing many vertices of large degree | 5 | 0.85 | 1992 |
| Label-connected graphs and the gossip problem | 7 | 2.79 | 1991 |
| Long dominating cycles and paths in graphs with large neighborhood unions | 5 | 1.06 | 1991 |
| Long cycles in graphs with large degree sums | 37 | 12.59 | 1990 |
| A generalization of a result of Ha¨ggkvist and Nicoghossian | 22 | 2.03 | 1989 |
| A result on Hamiltonian line graphs involving restrictions on induced subgraphs | 9 | 1.07 | 1988 |
| Contractibility and NP-completeness | 21 | 1.39 | 1987 |
| 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian | 12 | 1.20 | 1987 |
| On circuits and pancyclic line graphs | 20 | 2.53 | 1986 |
| Even graphs | 3 | 0.70 | 1986 |
| Existence of spanning and dominating trails and circuits | 7 | 3.49 | 1986 |
