| A complete bipartite graph without properly colored cycles of length four | 0 | 0.34 | 2020 |
| A panconnectivity theorem for bipartite graphs. | 0 | 0.34 | 2018 |
| Pairs of forbidden subgraphs and 2-connected supereulerian graphs. | 1 | 0.37 | 2018 |
| On Dominating Even Subgraphs in Cubic Graphs. | 0 | 0.34 | 2017 |
| Rainbow cycles in edge-colored graphs | 2 | 0.42 | 2016 |
| Vertex Coloring of Graphs by Total 2-Weightings. | 1 | 0.37 | 2016 |
| Locating sets of vertices on Hamiltonian cycles. | 0 | 0.34 | 2016 |
| Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. | 1 | 0.40 | 2016 |
| Equivalence of Jackson's and Thomassen's conjectures | 0 | 0.34 | 2015 |
| A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. | 1 | 0.36 | 2015 |
| 2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths. | 1 | 0.35 | 2015 |
| 2-factors with bounded number of components in claw-free graphs. | 0 | 0.34 | 2015 |
| Note on Locating Pairs of Vertices on Hamiltonian Cycles | 3 | 0.54 | 2014 |
| An Extremal Problem Resulting in Many Paths. | 0 | 0.34 | 2014 |
| 4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. | 1 | 0.36 | 2013 |
| 2-factors and independent sets on claw-free graphs | 3 | 0.40 | 2012 |
| Claw-free graphs and 2-factors that separate independent vertices | 5 | 0.45 | 2012 |
| 2-factors in claw-free graphs. | 0 | 0.34 | 2011 |
| A 2-Factor In Which Each Cycle Contains A Vertex In A Specified Stable Set | 2 | 0.39 | 2010 |
| Set-orderedness as a generalization of k-orderedness and cyclability | 1 | 0.35 | 2010 |
| Closure concept for 2-factors in claw-free graphs | 3 | 0.44 | 2010 |
| Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs | 7 | 0.51 | 2009 |
| lambda-backbone colorings along pairwise disjoint stars and matchings | 1 | 0.36 | 2009 |
| Spanning even subgraphs of 3-edge-connected graphs | 11 | 0.92 | 2009 |
| On a Spanning Tree with Specified Leaves | 4 | 0.68 | 2008 |
| Relative length of longest paths and longest cycles in triangle-free graphs | 3 | 0.44 | 2008 |
| Edge degrees and dominating cycles | 0 | 0.34 | 2008 |
| On components of 2-factors in claw-free graphs | 0 | 0.34 | 2007 |
| On the number of components in 2-factors of claw-free graphs | 11 | 0.65 | 2007 |
| Toughness and hamiltonicity in k-trees | 4 | 0.53 | 2007 |
| Even subgraphs of bridgeless graphs and 2-factors of line graphs | 12 | 0.95 | 2007 |
| The upper bound of the number of cycles in a 2-factor of a line graph | 9 | 0.84 | 2007 |
| Cycles through specified vertices in triangle-free graphs | 2 | 0.44 | 2007 |
| Heavy cycles passing through some specified vertices in weighted graphs | 3 | 0.56 | 2005 |
| A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition | 7 | 0.66 | 2003 |
| On a hamiltonian cycle in which specified vertices are not isolated | 0 | 0.34 | 2002 |
| On a 2-factor with a specified edge in a graph satisfying the Ore condition | 6 | 0.52 | 2002 |
| On geometric independency trees for points in the plane | 1 | 0.41 | 2002 |
| The Connectivities of Trunk Graphs of Connected Graphs | 1 | 0.35 | 2001 |
| Transformation Of Spanning Trees In A 2-Connected Graph | 0 | 0.34 | 2001 |
| On a Hamiltonian cycle in which specified vertices are uniformly distributed | 11 | 1.11 | 2001 |
| A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition | 0 | 0.34 | 2000 |
| On spanning trees with restricted degrees | 6 | 1.28 | 2000 |
| Alternating Hamilton Cycles With Minimum Number Of Crossings In The Plane | 8 | 0.83 | 2000 |
| Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition | 0 | 0.34 | 2000 |
| Some results on geometric independency trees | 0 | 0.34 | 1999 |
| The connectivities of leaf graphs of 2—connected graphs | 1 | 0.35 | 1999 |
