| Pure Pairs. Ii. Excluding All Subdivisions Of A Graph | 0 | 0.34 | 2021 |
| On the Erdős-Hajnal conjecture for six-vertex tournaments. | 0 | 0.34 | 2019 |
| Four-coloring P6-free graphs. | 0 | 0.34 | 2019 |
| Avoidable Vertices and Edges in Graphs. | 0 | 0.34 | 2019 |
| Coloring graphs with no induced five-vertex path or gem | 0 | 0.34 | 2018 |
| Piercing Axis-Parallel Boxes. | 0 | 0.34 | 2018 |
| Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. | 1 | 0.37 | 2018 |
| Decomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs. | 0 | 0.34 | 2017 |
| Forcing large transitive subtournaments | 1 | 0.41 | 2015 |
| A De Bruijn-Erdős Theorem for Chordal Graphs. | 0 | 0.34 | 2015 |
| Rao's degree sequence conjecture | 2 | 0.40 | 2014 |
| Extending the Gyárfás-Sumner conjecture | 2 | 0.62 | 2014 |
| Graphs with no induced five-vertex path or antipath. | 1 | 0.36 | 2014 |
| Lines in hypergraphs | 3 | 0.60 | 2013 |
| Detecting an induced net subdivision | 3 | 0.42 | 2013 |
| Coloring perfect graphs with no balanced skew-partitions. | 4 | 0.46 | 2013 |
| The Structure of Bull-Free Perfect Graphs. | 0 | 0.34 | 2013 |
| Excluding four-edge paths and their complements | 3 | 0.58 | 2013 |
| Substitution and Χ-boundedness | 5 | 0.79 | 2013 |
| Tournaments and colouring | 10 | 1.37 | 2013 |
| Tournament immersion and cutwidth | 8 | 1.03 | 2012 |
| Excluding Induced Subdivisions of the Bull and Related Graphs | 0 | 0.34 | 2012 |
| Claw-free graphs. VII. Quasi-line graphs | 13 | 0.76 | 2012 |
| The structure of bull-free graphs II and III-A summary | 20 | 2.05 | 2012 |
| The structure of bull-free graphs I-Three-edge-paths with centers and anticenters | 9 | 1.09 | 2012 |
| Three-colourable perfect graphs without even pairs | 2 | 0.36 | 2012 |
| LexBFS, structure and algorithms | 1 | 0.36 | 2012 |
| A well-quasi-order for tournaments | 13 | 1.40 | 2011 |
| The edge-density for K2,t minors | 1 | 0.36 | 2011 |
| An approximate version of Hadwiger's conjecture for claw-free graphs | 6 | 0.56 | 2010 |
| Claw-free graphs VI. Colouring | 11 | 0.81 | 2010 |
| K4-free graphs with no odd holes | 8 | 0.77 | 2010 |
| Even pairs in Berge graphs | 8 | 0.64 | 2009 |
| The Erdős--Hajnal conjecture for bull-free graphs | 21 | 1.46 | 2008 |
| Hadwiger's conjecture for quasi-line graphs | 11 | 0.84 | 2008 |
| Claw-free graphs. IV. Decomposition theorem | 29 | 3.93 | 2008 |
| Claw-free graphs. V. Global structure | 42 | 1.95 | 2008 |
| Bisimplicial vertices in even-hole-free graphs | 14 | 0.78 | 2008 |
| Solution of three problems of Cornuéjols | 1 | 0.36 | 2008 |
| Claw-free graphs. II. Non-orientable prismatic graphs | 16 | 14.64 | 2008 |
| Claw-free graphs. III. Circular interval graphs | 23 | 2.79 | 2008 |
| Claw-free graphs. I. Orientable prismatic graphs | 18 | 14.64 | 2007 |
