Nicolas Trotignon
Nicolas Trotignon
Неизвестная организация
Подтвержден адрес электронной почты в домене ens-lyon.fr
Название
Процитировано
Процитировано
Год
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
722010
Detecting induced subgraphs
B Lévêque, DY Lin, F Maffray, N Trotignon
Discrete Applied Mathematics 157 (17), 3540-3551, 2009
512009
Algorithms for perfectly contractile graphs
F Maffray, N Trotignon
SIAM Journal on Discrete Mathematics 19 (3), 553-574, 2005
462005
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
442012
A polynomial Turing-kernel for weighted independent set in bull-free graphs
S Thomassé, N Trotignon, K Vušković
Algorithmica 77 (3), 619-641, 2017
302017
Vertex elimination orderings for hereditary graph classes
P Aboulker, P Charbit, N Trotignon, K Vušković
Discrete Mathematics 338 (5), 825-834, 2015
302015
Combinatorial optimization with 2-joins
N Trotignon, K Vušković
Journal of Combinatorial Theory, Series B 102 (1), 153-185, 2012
292012
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
252015
Edge-colouring and total-colouring chordless graphs
RCS Machado, CMH de Figueiredo, N Trotignon
Discrete mathematics 313 (14), 1547-1552, 2013
252013
Perfect graphs: a survey
N Trotignon
arXiv preprint arXiv:1301.5149, 2013
252013
A class of perfectly contractile graphs
F Maffray, N Trotignon
Journal of Combinatorial Theory, Series B 96 (1), 1-19, 2006
242006
Substitution and -Boundedness
M Chudnovsky, I Penev, A Scott, N Trotignon
arXiv preprint arXiv:1302.1145, 2013
222013
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
212012
Decomposing Berge graphs and detecting balanced skew partitions
N Trotignon
Journal of Combinatorial Theory, Series B 98 (1), 173-225, 2008
212008
Algorithms for Square-3PC()-Free Berge Graphs
F Maffray, N Trotignon, K Vušković
SIAM Journal on Discrete Mathematics 22 (1), 51-71, 2008
212008
Detecting 2-joins faster
P Charbit, M Habib, N Trotignon, K Vušković
Journal of discrete algorithms 17, 60-66, 2012
202012
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
192012
Finding an induced subdivision of a digraph
J Bang-Jensen, F Havet, N Trotignon
Theoretical Computer Science 443, 10-24, 2012
172012
Equistarable graphs and counterexamples to three conjectures on equistable graphs
M Milanič, N Trotignon
Journal of Graph Theory 84 (4), 536-551, 2017
152017
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
142016
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20