Nicolas Trotignon

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 42

Top Venues

CoRR

J. Graph Theory

J. Comb. Theory, Ser. B

Eur. J. Comb.

Joseph Fourier University, Grenoble, France (PHD)

Education History

Joseph Fourier University, Grenoble, France

PHD

Publications

Chính T. Hoàng, Nicolas Trotignon
A class of graphs with large rankwidth. Discret. Math. 347 (1) (2024)
Pegah Pournajafi, Nicolas Trotignon
Burling graphs revisited, part III: Applications to χ-boundedness. Eur. J. Comb. 116 (2024)
Linda Cook, Jake Horsfield, Myriam Preissmann, Cléophée Robin, Paul D. Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vuskovic
Graphs with all holes the same length. J. Comb. Theory B 168 (2024)
Pegah Pournajafi, Nicolas Trotignon
Burling graphs revisited, part II: Structure. Eur. J. Comb. 116 (2024)
Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
as an induced minor. CoRR (2024)
Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR (2024)
Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon
Graphs without a 3-connected subgraph are 4-colorable. CoRR (2024)
Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
as an Induced Minor. IWOCA (2024)
Pegah Pournajafi, Nicolas Trotignon
Burling graphs revisited, part I: New characterizations. Eur. J. Comb. 110 (2023)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
Graphs with polynomially many minimal separators. J. Comb. Theory, Ser. B 152 (2022)
Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
The (theta, wheel)-free graphs Part IV: Induced paths and cycles. J. Comb. Theory, Ser. B 146 (2021)
Pegah Pournajafi, Nicolas Trotignon
Burling graphs revisited, part III: Applications to χ-boundedness. CoRR (2021)
Myriam Preissmann, Cléophée Robin, Nicolas Trotignon
On the Complexity of Colouring Antiprismatic Graphs. Algorithmica 83 (2) (2021)
Ni Luh Dewi Sintiari, Nicolas Trotignon
)-free graphs - Part 1: Layered wheels. J. Graph Theory 97 (4) (2021)
Pegah Pournajafi, Nicolas Trotignon
Burling graphs revisited - Part 1 New characterizations. CoRR (2021)
Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
)-free graphs. Part 2: Bounds on treewidth. J. Graph Theory 97 (4) (2021)
Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
On the tree-width of even-hole-free graphs. Eur. J. Comb. 98 (2021)
Emilie Diot, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs. J. Comb. Theory, Ser. B 143 (2020)
Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
The (theta, wheel)-free graphs Part II: Structure theorem. J. Comb. Theory, Ser. B 143 (2020)
Chính Hoàng, Nicolas Trotignon
A class of graphs of large rankwidth. CoRR (2020)
Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
On the tree-width of even-hole-free graphs. CoRR (2020)
Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring. J. Comb. Theory, Ser. B 143 (2020)
Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon
)-free graphs. Part 2 : bounds on treewidth. CoRR (2020)
Ni Luh Dewi Sintiari, Nicolas Trotignon
)-free graphs. Part 1 : Layered wheels. CoRR (2019)
Edin Husic, Stéphan Thomassé, Nicolas Trotignon
The Independent Set Problem Is FPT for Even-Hole-Free Graphs. IPEC (2019)
Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vuskovic
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory 92 (2) (2019)
Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
Maximum independent sets in (pyramid, even hole)-free graphs. CoRR (2019)
Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Coloring square-free Berge graphs. J. Comb. Theory, Ser. B 135 (2019)
Myriam Preissmann, Cléophée Robin, Nicolas Trotignon
On the complexity of colouring antiprismatic graphs. CoRR (2019)
Nicolas Trotignon, Lan Anh Pham
χ-bounds, operations, and chords. J. Graph Theory 88 (2) (2018)
Martin Milanic, Irena Penev, Nicolas Trotignon
Stable Sets in {ISK4, wheel}-Free Graphs. Algorithmica 80 (2) (2018)
Ngoc-Khang Le, Nicolas Trotignon
Connected greedy colouring in claw-free graphs. CoRR (2018)
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
Coloring Graphs with Constraints on Connectivity. J. Graph Theory 85 (4) (2017)
Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. 231 (2017)
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Martin Milanic, Nicolas Trotignon
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs. J. Graph Theory 84 (4) (2017)
Nicolas Trotignon, Kristina Vuskovic
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph. J. Graph Theory 84 (3) (2017)
Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Algorithmica 77 (3) (2017)
Lan Anh Pham, Nicolas Trotignon
$χ$-bounds, operations and chords. CoRR (2016)
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
On rank-width of even-hole-free graphs. CoRR (2016)
Irena Penev, Stéphan Thomassé, Nicolas Trotignon
Isolating Highly Connected Induced Subgraphs. SIAM J. Discret. Math. 30 (1) (2016)
Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon
Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory, Ser. B 116 (2016)
Celina M. H. de Figueiredo, Hélio B. Macêdo Filho, Z. Li, Raphael Carlos Santos Machado, Nicolas Trotignon
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions. Electron. Notes Discret. Math. 50 (2015)
Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic
Vertex elimination orderings for hereditary graph classes. Discret. Math. 338 (5) (2015)
Pierre Aboulker, Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon
Wheel-free planar graphs. Eur. J. Comb. 49 (2015)
Pierre Aboulker, Nick Brettell, Frédéric Havet, Dániel Marx, Nicolas Trotignon
Colouring graphs with constraints on connectivity. CoRR (2015)
Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic
Coloring perfect graphs with no balanced skew-partitions. J. Comb. Theory, Ser. B 115 (2015)
Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic
Linear Balanceable and Subcubic Balanceable Graphs. J. Graph Theory 75 (2) (2014)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs. Discret. Appl. Math. 164 (2014)
Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. WG (2014)
Martin Milanic, Nicolas Trotignon
Equistarable graphs and counterexamples to three conjectures on equistable graphs. CoRR (2014)
Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon
The four-in-a-tree problem in triangle-free graphs. CoRR (2013)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Complexity of colouring problems restricted to unichord-free and \{square, unichord\}-free graphs. CoRR (2013)
Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
Graphs that do not contain a cycle with a node that has at least two neighbors on it. CoRR (2013)
Frédéric Maffray, Nicolas Trotignon
Algorithms for perfectly contractile graphs. CoRR (2013)
Emilie Diot, Sébastien Tavenas, Nicolas Trotignon
Detecting wheels. CoRR (2013)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Edge-colouring and total-colouring chordless graphs. CoRR (2013)
Wei Liu, Nicolas Trotignon
The $k$-in-a-tree problem for graphs of girth at least~$k$. CoRR (2013)
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
Detecting induced subgraphs. CoRR (2013)
Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR (2013)
Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon
Detecting an induced net subdivision. CoRR (2013)
Nicolas Trotignon, Kristina Vuskovic
Combinatorial optimization with 2-joins. CoRR (2013)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. CoRR (2013)
Nicolas Trotignon
Perfect graphs: a survey CoRR (2013)
Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon
Detecting an induced net subdivision. J. Comb. Theory, Ser. B 103 (5) (2013)
Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic
Coloring perfect graphs with no balanced skew-partitions. CoRR (2013)
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs. CoRR (2013)
Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon
Substitution and χ-boundedness. J. Comb. Theory, Ser. B 103 (5) (2013)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Edge-colouring and total-colouring chordless graphs. Discret. Math. 313 (14) (2013)
Nicolas Trotignon, Kristina Vuskovic
Combinatorial optimization with 2-joins. J. Comb. Theory, Ser. B 102 (1) (2012)
András Gyárfás, András Sebö, Nicolas Trotignon
The chromatic gap and its extremes. J. Comb. Theory, Ser. B 102 (5) (2012)
Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
Detecting 2-joins faster. J. Discrete Algorithms 17 (2012)
Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It. SIAM J. Discret. Math. 26 (4) (2012)
Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon
Excluding Induced Subdivisions of the Bull and Related Graphs. J. Graph Theory 71 (1) (2012)
Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon
. J. Comb. Theory, Ser. B 102 (4) (2012)
Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic
LexBFS, structure and algorithms CoRR (2012)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. Theor. Comput. Sci. 443 (2012)
Maurice Pouzet, Hamza Si Kaddour, Nicolas Trotignon
Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem. Contributions Discret. Math. 6 (1) (2011)
Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
Detecting 2-joins faster CoRR (2011)
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon
Finding an induced subdivision of a digraph. Electron. Notes Discret. Math. 37 (2011)
Nicolas Trotignon, Kristina Vuskovic
On Roussel-Rubio-type lemmas and their consequences. Discret. Math. 311 (8-9) (2011)
Raphael Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Chromatic Index of Chordless Graphs. CTW (2010)
Wei Liu, Nicolas Trotignon
The k-in-a-tree problem for graphs of girth at least k. Discret. Appl. Math. 158 (15) (2010)
Nicolas Trotignon, Kristina Vuskovic
A structure theorem for graphs with no cycle with a unique chord and its consequences. J. Graph Theory 63 (1) (2010)
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
Detecting induced subgraphs. Discret. Appl. Math. 157 (17) (2009)
Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon
The Four-in-a-Tree Problem in Triangle-Free Graphs. Graphs Comb. 25 (4) (2009)
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
Coloring Artemis graphs. Theor. Comput. Sci. 410 (21-23) (2009)
Nicolas Trotignon
Decomposing Berge graphs and detecting balanced skew partitions. J. Comb. Theory, Ser. B 98 (1) (2008)
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Algorithms for Square-3PC(., .)-Free Berge Graphs. SIAM J. Discret. Math. 22 (1) (2008)
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
Detecting induced subgraphs. Electron. Notes Discret. Math. 29 (2007)
Frédéric Maffray, Nicolas Trotignon
A class of perfectly contractile graphs. J. Comb. Theory, Ser. B 96 (1) (2006)
Nicolas Trotignon
On the structure of self-complementary graphs. Electron. Notes Discret. Math. 22 (2005)
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic
Algorithms for 3PC(., .)-free Berge graphs. Electron. Notes Discret. Math. 22 (2005)
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
Coloring Artemis graphs CoRR (2005)
Frédéric Maffray, Nicolas Trotignon
Algorithms for Perfectly Contractile Graphs. SIAM J. Discret. Math. 19 (3) (2005)
Sylvain Gravier, Frédéric Maffray, Jérôme Renault, Nicolas Trotignon
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets. Eur. J. Comb. 25 (5) (2004)

Nicolas Trotignon.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicolas Trotignon