Follow
Nicolas Trotignon
Nicolas Trotignon
Unknown affiliation
Verified email at ens-lyon.fr
Title
Cited by
Cited by
Year
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
822010
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
602012
Detecting induced subgraphs
B Lévêque, DY Lin, F Maffray, N Trotignon
Discrete Applied Mathematics 157 (17), 3540-3551, 2009
602009
Algorithms for perfectly contractile graphs
F Maffray, N Trotignon
SIAM Journal on Discrete Mathematics 19 (3), 553-574, 2005
532005
Perfect graphs: a survey
N Trotignon
arXiv preprint arXiv:1301.5149, 2013
412013
A polynomial Turing-kernel for weighted independent set in bull-free graphs
S Thomassé, N Trotignon, K Vušković
Algorithmica 77, 619-641, 2017
392017
Substitution and ÷-boundedness
M Chudnovsky, I Penev, A Scott, N Trotignon
Journal of Combinatorial Theory, Series B 103 (5), 567-586, 2013
342013
Vertex elimination orderings for hereditary graph classes
P Aboulker, P Charbit, N Trotignon, K Vušković
Discrete Mathematics 338 (5), 825-834, 2015
332015
Edge-colouring and total-colouring chordless graphs
RCS Machado, CMH de Figueiredo, N Trotignon
Discrete mathematics 313 (14), 1547-1552, 2013
312013
Combinatorial optimization with 2-joins
N Trotignon, K Vušković
Journal of Combinatorial Theory, Series B 102 (1), 153-185, 2012
302012
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
292015
A class of perfectly contractile graphs
F Maffray, N Trotignon
Journal of Combinatorial Theory, Series B 96 (1), 1-19, 2006
282006
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
262012
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
252016
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
242012
Decomposing Berge graphs and detecting balanced skew partitions
N Trotignon
Journal of Combinatorial Theory, Series B 98 (1), 173-225, 2008
242008
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
232021
Algorithms for Square-3PC()-Free Berge Graphs
F Maffray, N Trotignon, K Vušković
SIAM Journal on Discrete Mathematics 22 (1), 51-71, 2008
232008
(Theta, triangle)‐free and (even hole, )‐free graphs—Part 1: Layered wheels
NLD Sintiari, N Trotignon
Journal of Graph Theory 97 (4), 475-509, 2021
202021
Detecting 2-joins faster
P Charbit, M Habib, N Trotignon, K Vušković
Journal of discrete algorithms 17, 60-66, 2012
202012
The system can't perform the operation now. Try again later.
Articles 1–20