The strong perfect graph theorem M Chudnovsky, N Robertson, P Seymour, R Thomas Annals of mathematics, 51-229, 2006 | 1320 | 2006 |

Recognizing berge graphs M Chudnovsky, G Cornuéjols, X Liu, P Seymour, K Vušković Combinatorica 25 (2), 143-186, 2005 | 380 | 2005 |

The structure of claw-free graphs. M Chudnovsky, PD Seymour Surveys in combinatorics 327, 153-171, 2005 | 205 | 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 | 183 | 2007 |

Progress on perfect graphs M Chudnovsky, N Robertson, PD Seymour, R Thomas Mathematical Programming 97 (1), 405-422, 2003 | 99 | 2003 |

Claw-free graphs. V. Global structure M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 98 (6), 1373-1410, 2008 | 86 | 2008 |

Packing Non-Zero *A*-Paths In Group-Labelled GraphsM Chudnovsky, J Geelen, B Gerards, L Goddyn, M Lohman, P Seymour Combinatorica 26 (5), 521-532, 2006 | 77 | 2006 |

The Erdös–Hajnal conjecture—a survey M Chudnovsky Journal of Graph Theory 75 (2), 178-190, 2014 | 69 | 2014 |

Claw-free graphs VI. Colouring M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 100 (6), 560-572, 2010 | 68 | 2010 |

Claw-free graphs. IV. Decomposition theorem M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 98 (5), 839-938, 2008 | 68 | 2008 |

The three-in-a-tree problem M Chudnovsky, P Seymour Combinatorica 30 (4), 387-417, 2010 | 63 | 2010 |

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 | 62 | 2018 |

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 | 54 | 2008 |

The Erdős–Hajnal conjecture for bull-free graphs M Chudnovsky, S Safra Journal of Combinatorial Theory, Series B 98 (6), 1301-1310, 2008 | 53 | 2008 |

Analyzing the performance of greedy maximal scheduling via local pooling and graph theory B Birand, M Chudnovsky, B Ries, P Seymour, G Zussman, Y Zwols IEEE/ACM Transactions on Networking 20 (1), 163-176, 2011 | 52 | 2011 |

Detecting even holes M Chudnovsky, K Kawarabayashi, P Seymour Journal of Graph Theory 48 (2), 85-111, 2005 | 52 | 2005 |

Berge trigraphs M Chudnovsky Journal of Graph Theory 53 (1), 1-55, 2006 | 49 | 2006 |

Claw-free graphs. III. Circular interval graphs M Chudnovsky, P Seymour Journal of Combinatorial Theory, Series B 98 (4), 812-834, 2008 | 48 | 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 | 46 | 2013 |

Coloring quasi‐line graphs M Chudnovsky, A Ovetsky Journal of Graph Theory 54 (1), 41-50, 2007 | 45 | 2007 |