| The strong perfect graph theorem M Chudnovsky, N Robertson, P Seymour, R Thomas Annals of mathematics, 51-229, 2006 | 1689 | 2006 |
| Recognizing berge graphs M Chudnovsky*, G Cornuéjols**, X Liu, P Seymour, K Vušković Combinatorica 25 (2), 143-186, 2005 | 433 | 2005 |
| The structure of claw-free graphs. M Chudnovsky, PD Seymour BCC, 153-171, 2005 | 262 | 2005 |
| The roots of the independence polynomial of a clawfree graph M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 97 (3), 350-357, 2007 | 229 | 2007 |
| Progress on perfect graphs M Chudnovsky, N Robertson, PD Seymour, R Thomas Mathematical Programming 97, 405-422, 2003 | 118 | 2003 |
| The Erdös–Hajnal conjecture—a survey M Chudnovsky Journal of Graph Theory 75 (2), 178-190, 2014 | 116 | 2014 |
| Claw-free graphs. V. Global structure M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 98 (6), 1373-1410, 2008 | 106 | 2008 |
| Three-coloring and list three-coloring of graphs without induced paths on seven vertices F Bonomo, M Chudnovsky, P Maceli, O Schaudt, M Stein, M Zhong Combinatorica 38 (4), 779-801, 2018 | 99 | 2018 |
| Packing Non-Zero A-Paths In Group-Labelled Graphs M Chudnovsky, J Geelen, B Gerards, L Goddyn, M Lohman, P Seymour Combinatorica 26, 521-532, 2006 | 97 | 2006 |
| The three-in-a-tree problem M Chudnovsky, P Seymour Combinatorica 30 (4), 387-417, 2010 | 96 | 2010 |
| The Erdős–Hajnal conjecture for bull-free graphs M Chudnovsky, S Safra Journal of Combinatorial Theory, Series B 98 (6), 1301-1310, 2008 | 80 | 2008 |
| Tournaments and colouring E Berger, K Choromanski, M Chudnovsky, J Fox, M Loebl, A Scott, ... Journal of Combinatorial Theory, Series B 103 (1), 1-20, 2013 | 79 | 2013 |
| Claw-free graphs. IV. Decomposition theorem M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 98 (5), 839-938, 2008 | 77 | 2008 |
| Claw-free graphs VI. Colouring M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 100 (6), 560-572, 2010 | 71 | 2010 |
| Bisimplicial vertices in even-hole-free graphs L Addario-Berry, M Chudnovsky, F Havet, B Reed, P Seymour Journal of Combinatorial Theory, Series B 98 (6), 1119-1164, 2008 | 68 | 2008 |
| Detecting even holes M Chudnovsky, K Kawarabayashi, P Seymour Journal of Graph Theory 48 (2), 85-111, 2005 | 62 | 2005 |
| Claw-free graphs. III. Circular interval graphs M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 98 (4), 812-834, 2008 | 61 | 2008 |
| Four-coloring P6-free graphs M Chudnovsky, S Spirkl, M Zhong Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 55 | 2019 |
| Induced subgraphs of graphs with large chromatic number. III. Long holes M Chudnovsky, A Scott, P Seymour Combinatorica 37 (6), 1057-1072, 2017 | 55 | 2017 |
| A well-quasi-order for tournaments M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 101 (1), 47-53, 2011 | 53 | 2011 |
