| Better 3-Coloring Algorithms: Excluding A Triangle And A Seven Vertex Path | 0 | 0.34 | 2021 |
| A variant of the Erdős‐Sós conjecture | 0 | 0.34 | 2020 |
| Regularity inheritance in pseudorandom graphs | 0 | 0.34 | 2020 |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles: SCHAUDT and STEIN | 0 | 0.34 | 2019 |
| Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles: BUSTAMANTE et al. | 0 | 0.34 | 2019 |
| Large Immersions in Graphs with Independence Number 3 and 4. | 0 | 0.34 | 2019 |
| Monochromatic tree covers and Ramsey numbers for set-coloured graphs. | 0 | 0.34 | 2018 |
| Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles. | 0 | 0.34 | 2018 |
| Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. | 1 | 0.37 | 2018 |
| Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. | 0 | 0.34 | 2017 |
| The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. | 0 | 0.34 | 2017 |
| Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. | 0 | 0.34 | 2017 |
| The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. | 0 | 0.34 | 2017 |
| Clique coloring B1-EPG graphs. | 3 | 0.40 | 2017 |
| The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. | 0 | 0.34 | 2017 |
| The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. | 0 | 0.34 | 2017 |
| Approximately coloring graphs without long induced paths. | 0 | 0.34 | 2017 |
| List Edge-Coloring and Total Coloring in Graphs of Low Treewidth | 0 | 0.34 | 2016 |
| Monochromatic Cycle Partitions in Local Edge Colorings | 3 | 0.43 | 2016 |
| Convex p-partitions of bipartite graphs. | 2 | 0.47 | 2016 |
| Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles | 0 | 0.34 | 2015 |
| Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. | 0 | 0.34 | 2015 |
| Local colourings and monochromatic partitions in complete bipartite graphs | 2 | 0.40 | 2015 |
| Minimal bricks have many vertices of small degree | 0 | 0.34 | 2014 |
| Connectivity and tree structure in finite graphs | 7 | 0.74 | 2014 |
| Small degree vertices in minimal bricks. | 0 | 0.34 | 2013 |
| On claw-free t-perfect graphs | 2 | 0.37 | 2012 |
| Ends and Vertices of Small Degree in Infinite Minimally $k$-(Edge)-Connected Graphs | 2 | 0.38 | 2010 |
| t-Perfection Is Always Strong for Claw-Free Graphs | 2 | 0.36 | 2010 |
| On end degrees and infinite cycles in locally finite graphs | 20 | 1.63 | 2007 |
| MacLane's planarity criterion for locally finite graphs | 17 | 1.27 | 2006 |
| Menger's theorem for infinite graphs with ends | 5 | 0.45 | 2005 |
| Cycle-cocycle partitions and faithful cycle covers for locally finite graphs | 15 | 1.62 | 2005 |
