Nicolas Trotignon

From MaRDI portal
Revision as of 10:11, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Nicolas Trotignon to Nicolas Trotignon: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:442236

Available identifiers

zbMath Open trotignon.nicolasWikidataQ102307479 ScholiaQ102307479MaRDI QIDQ442236

List of research outcomes

PublicationDate of PublicationType
Burling graphs revisited. II: Structure2024-02-05Paper
Burling graphs revisited. III: Applications to \(\chi \)-boundedness2024-02-05Paper
A class of graphs with large rankwidth2023-10-30Paper
(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels2023-10-04Paper
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth2023-10-04Paper
Burling graphs revisited. I: New characterizations2023-04-27Paper
A tamed family of triangle-free graphs with unbounded chromatic number2023-04-09Paper
https://portal.mardi4nfdi.de/entity/Q58755552023-02-03Paper
When all holes have the same length2022-03-22Paper
Graphs with polynomially many minimal separators2021-11-17Paper
Graphs with all holes the same length2021-10-19Paper
On the tree-width of even-hole-free graphs2021-09-02Paper
Burling graphs revisited, part I: New characterizations2021-04-14Paper
On the complexity of colouring antiprismatic graphs2021-03-26Paper
The (theta, wheel)-free graphs. IV: Induced paths and cycles2021-02-03Paper
The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs2020-04-22Paper
The (theta, wheel)-free graphs. II: Structure theorem2020-04-22Paper
The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring2020-04-22Paper
Maximum independent sets in (pyramid, even hole)-free graphs2019-12-24Paper
Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable2019-10-31Paper
On the complexity of colouring antiprismatic graphs2019-10-24Paper
The independent set problem is FPT for even-hole-free graphs2019-07-01Paper
Coloring square-free Berge graphs2019-02-08Paper
Coloring graphs with no induced subdivision of $K_4^+$2019-01-14Paper
On rank-width of even-hole-free graphs2018-11-30Paper
χ‐bounds, operations, and chords2018-07-13Paper
Connected greedy colouring in claw-free graphs2018-05-04Paper
Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs2018-04-06Paper
Coloring Graphs with Constraints on Connectivity2017-08-10Paper
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph2017-04-21Paper
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs2017-04-21Paper
A polynomial Turing-kernel for weighted independent set in bull-free graphs2017-04-12Paper
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions2016-10-17Paper
https://portal.mardi4nfdi.de/entity/Q28225942016-09-30Paper
Detecting wheels2016-06-27Paper
Isolating Highly Connected Induced Subgraphs2016-04-07Paper
A decomposition theorem for {ISK4,wheel}-free trigraphs2016-02-07Paper
Perfect graphs of arbitrarily large clique-chromatic number2015-12-11Paper
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs2015-09-22Paper
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs2015-09-09Paper
Coloring perfect graphs with no balanced skew-partitions2015-08-21Paper
Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem2015-08-03Paper
Wheel-free planar graphs2015-06-18Paper
Vertex elimination orderings for hereditary graph classes2015-01-30Paper
Substitution and \(\chi\)-boundedness2014-10-13Paper
Detecting an induced net subdivision2014-10-13Paper
Linear Balanceable and Subcubic Balanceable Graphs*2014-01-28Paper
Edge-colouring and total-colouring chordless graphs2014-01-20Paper
Complements of nearly perfect graphs2013-11-05Paper
On wheel-free graphs2013-09-09Paper
Graphes parfaits : structure et algorithmes2013-08-31Paper
Structure of classes of graphs defined by forbidding induced subgraphs2013-08-30Paper
Finding an induced subdivision of a digraph2013-07-23Paper
Detecting 2-joins faster2013-06-24Paper
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It2013-04-09Paper
Perfect graphs: a survey2013-01-22Paper
The chromatic gap and its extremes2012-10-19Paper
Excluding Induced Subdivisions of the Bull and Related Graphs2012-09-12Paper
On graphs with no induced subdivision of \(K_4\)2012-08-14Paper
Finding an induced subdivision of a digraph2012-08-10Paper
Combinatorial optimization with 2-joins2012-03-19Paper
On Roussel-Rubio-type lemmas and their consequences2011-05-06Paper
Detecting induced subgraphs2010-04-28Paper
A structure theorem for graphs with no cycle with a unique chord and its consequences2010-03-15Paper
The four-in-a-tree problem in triangle-free graphs2010-01-18Paper
Coloring Artemis graphs2009-05-28Paper
Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs2009-03-16Paper
Detecting induced subgraphs2008-06-05Paper
Decomposing Berge graphs and detecting balanced skew partitions2007-12-10Paper
Algorithms for 3PC(⋅, ⋅)-free Berge graphs2007-05-29Paper
On the structure of self-complementary graphs2007-05-29Paper
Odd pairs of cliques2007-03-05Paper
Algorithms for Perfectly Contractile Graphs2006-06-01Paper
A class of perfectly contractile graphs2006-01-10Paper
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets2004-08-06Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Nicolas Trotignon