| A structure theorem for graphs with no cycle with a unique chord and its consequences N Trotignon, K Vušković Journal of Graph Theory 63 (1), 31-67, 2010 | 81 | 2010 |
| Detecting induced subgraphs B Lévêque, DY Lin, F Maffray, N Trotignon Discrete Applied Mathematics 157 (17), 3540-3551, 2009 | 58 | 2009 |
| On graphs with no induced subdivision of K4 B Lévêque, F Maffray, N Trotignon Journal of Combinatorial Theory, Series B 102 (4), 924-947, 2012 | 56 | 2012 |
| Algorithms for perfectly contractile graphs F Maffray, N Trotignon SIAM Journal on Discrete Mathematics 19 (3), 553-574, 2005 | 52 | 2005 |
| A polynomial Turing-kernel for weighted independent set in bull-free graphs S Thomassé, N Trotignon, K Vušković Algorithmica 77, 619-641, 2017 | 36 | 2017 |
| Perfect graphs: a survey N Trotignon arXiv preprint arXiv:1301.5149, 2013 | 35 | 2013 |
| Vertex elimination orderings for hereditary graph classes P Aboulker, P Charbit, N Trotignon, K Vušković Discrete Mathematics 338 (5), 825-834, 2015 | 34 | 2015 |
| Combinatorial optimization with 2-joins N Trotignon, K Vušković Journal of Combinatorial Theory, Series B 102 (1), 153-185, 2012 | 31 | 2012 |
| Coloring perfect graphs with no balanced skew-partitions M Chudnovsky, N Trotignon, T Trunck, K Vušković Journal of Combinatorial Theory, Series B 115, 26-65, 2015 | 30 | 2015 |
| Edge-colouring and total-colouring chordless graphs RCS Machado, CMH de Figueiredo, N Trotignon Discrete mathematics 313 (14), 1547-1552, 2013 | 30 | 2013 |
| Substitution and χ-boundedness M Chudnovsky, I Penev, A Scott, N Trotignon Journal of Combinatorial Theory, Series B 103 (5), 567-586, 2013 | 28 | 2013 |
| The chromatic gap and its extremes A Gyárfás, A Sebő, N Trotignon Journal of Combinatorial Theory, Series B 102 (5), 1155-1178, 2012 | 27 | 2012 |
| A class of perfectly contractile graphs F Maffray, N Trotignon Journal of Combinatorial Theory, Series B 96 (1), 1-19, 2006 | 27 | 2006 |
| Decomposing Berge graphs and detecting balanced skew partitions N Trotignon Journal of Combinatorial Theory, Series B 98 (1), 173-225, 2008 | 25 | 2008 |
| Graphs that do not contain a cycle with a node that has at least two neighbors on it P Aboulker, M Radovanovic, N Trotignon, K Vuskovic SIAM Journal on Discrete Mathematics 26 (4), 1510-1531, 2012 | 23 | 2012 |
| Algorithms for Square-3PC()-Free Berge Graphs F Maffray, N Trotignon, K Vušković SIAM Journal on Discrete Mathematics 22 (1), 51-71, 2008 | 23 | 2008 |
| Perfect graphs of arbitrarily large clique-chromatic number P Charbit, I Penev, S Thomassé, N Trotignon Journal of Combinatorial Theory, Series B 116, 456-464, 2016 | 21 | 2016 |
| Detecting 2-joins faster P Charbit, M Habib, N Trotignon, K Vušković Journal of discrete algorithms 17, 60-66, 2012 | 21 | 2012 |
| On the tree-width of even-hole-free graphs P Aboulker, I Adler, EJ Kim, NLD Sintiari, N Trotignon European Journal of Combinatorics 98, 103394, 2021 | 19 | 2021 |
| The k-in-a-tree problem for graphs of girth at least k W Liu, N Trotignon Discrete Applied Mathematics 158 (15), 1644-1649, 2010 | 19 | 2010 |
Maria ChudnovskyPrinceton UniversityVerified email at math.princeton.edu
