| Path decompositions of triangle-free graphs | 0 | 0.34 | 2022 |
| Decompositions Of 6-Regular Bipartite Graphs Into Paths Of Length Six | 0 | 0.34 | 2021 |
| On Gallai'S Conjecture For Graphs With Maximum Degree 6 | 0 | 0.34 | 2021 |
| Circuit Covers Of Signed Eulerian Graphs | 0 | 0.34 | 2021 |
| Circuit K-Covers Of Signed Graphs | 1 | 0.35 | 2021 |
| Extensions of matroid covering and packing. | 0 | 0.34 | 2019 |
| Large even factors of graphs. | 0 | 0.34 | 2018 |
| Bisections of Graphs Without Short Cycles. | 2 | 0.38 | 2018 |
| Short signed circuit covers of signed graphs. | 1 | 0.35 | 2018 |
| Integer 4-Flows and Cycle Covers. | 1 | 0.39 | 2017 |
| Bounds for pairs in judicious partitioning of graphs. | 4 | 0.43 | 2017 |
| Maximum even factors of graphs. | 2 | 0.60 | 2016 |
| Decomposing a graph into pseudoforests with one having bounded degree | 4 | 0.53 | 2015 |
| Forbidden Subgraphs and 3-Colorings. | 1 | 0.36 | 2014 |
| The Erdős-Sós conjecture for spiders of large size. | 2 | 0.42 | 2013 |
| Upper bounds on minimum balanced bipartitions | 4 | 0.51 | 2012 |
| Relative Length of Longest Paths and Cycles in 2-Connected Graphs | 0 | 0.34 | 2009 |
| Nowhere-zero 3-flows in triangularly connected graphs | 22 | 1.16 | 2008 |
| Ore Condition and Nowhere-Zero 3-Flows | 22 | 1.34 | 2008 |
| Degree sum and nowhere-zero 3-flows | 16 | 0.87 | 2008 |
| The Erdös-Sós conjecture for spiders | 5 | 0.60 | 2007 |
| Path decompositions and Gallai's conjecture | 14 | 1.76 | 2005 |
| Cycles in 4-connected planar graphs | 5 | 0.57 | 2004 |
| Cycles in 2-connected graphs | 5 | 0.79 | 2004 |
| Circular Chromatic Number and Mycielski Graphs | 13 | 1.03 | 2004 |
| Covers of Eulerian graphs | 2 | 0.45 | 2003 |
| Hajós’ conjecture and projective graphs | 1 | 0.48 | 2002 |
| Subgraph coverings and edge switchings | 7 | 1.93 | 2002 |
| Distribution of cycle lengths in graphs | 7 | 0.79 | 2002 |
| Spanning Trees of Bounded Degree | 6 | 0.60 | 2001 |
| Circuit decompositions of Eulerian graphs | 3 | 0.65 | 2000 |
| Proofs of two minimum circuit cover conjectures | 8 | 0.58 | 1998 |
| Minimum cycle covers of graphs | 2 | 0.41 | 1997 |
| Extensions of flow theorems | 2 | 0.41 | 1997 |
| Partitioning a graph into two square-cycles | 6 | 0.58 | 1996 |
| Hamiltonian square-paths | 17 | 2.21 | 1996 |
| Circuit coverings of graphs and a conjecture of Pyber | 2 | 0.88 | 1995 |
| Path covers of weighted graphs | 1 | 0.35 | 1995 |
| The square of paths and cycles | 18 | 2.85 | 1995 |
| Short cycle covers of cubic graphs | 5 | 0.53 | 1994 |
| The Square of a Hamiltonian Cycle | 12 | 2.38 | 1994 |
| Tutte's 3-flow conjecture and short cycle covers | 4 | 0.50 | 1993 |
| Integer flows and cycle covers | 15 | 1.41 | 1992 |
| Covering graphs by cycles | 16 | 3.89 | 1992 |
| Cycles In Weighted Graphs | 11 | 1.61 | 1991 |
| Hamiltonian Properties Of Graphs With Large Neighborhood Unions | 20 | 2.13 | 1991 |
| Covering weighted graphs by even subgraphs | 9 | 0.91 | 1990 |
| Degree sum for a triangle in a graph | 3 | 2.83 | 1988 |
| On diameter 2-critical graphs | 20 | 3.58 | 1987 |
| Longest cycles in regular graphs | 10 | 1.32 | 1985 |
