Nicolas Trotignon

From MaRDI portal
(Redirected from Person:442236)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Induced minor models. I: Structural properties and algorithmic consequences
Journal of Computer and System Sciences
2026-02-11Paper
On treewidth and maximum cliques
Innovations in Graph Theory
2025-11-05Paper
Graphs with all holes the same length
Journal of Combinatorial Theory. Series B
2024-07-01Paper
Burling graphs revisited. II: Structure
European Journal of Combinatorics
2024-02-05Paper
Burling graphs revisited. III: Applications to \(\chi \)-boundedness
European Journal of Combinatorics
2024-02-05Paper
A class of graphs with large rankwidth
Discrete Mathematics
2023-10-30Paper
(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
Journal of Graph Theory
2023-10-04Paper
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
Journal of Graph Theory
2023-10-04Paper
Burling graphs revisited. I: New characterizations
European Journal of Combinatorics
2023-04-27Paper
A tamed family of triangle-free graphs with unbounded chromatic number2023-04-09Paper
scientific article; zbMATH DE number 7650229 (Why is no real title available?)
(available as arXiv preprint)
2023-02-03Paper
When all holes have the same length2022-03-22Paper
Graphs with polynomially many minimal separators
Journal of Combinatorial Theory. Series B
2021-11-17Paper
Graphs with all holes the same length2021-10-19Paper
On the tree-width of even-hole-free graphs
European Journal of Combinatorics
2021-09-02Paper
Burling graphs revisited, part I: New characterizations
(available as arXiv preprint)
2021-04-14Paper
On the complexity of colouring antiprismatic graphs
Algorithmica
2021-03-26Paper
The (theta, wheel)-free graphs. IV: Induced paths and cycles
Journal of Combinatorial Theory. Series B
2021-02-03Paper
The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
Journal of Combinatorial Theory. Series B
2020-04-22Paper
The (theta, wheel)-free graphs. II: Structure theorem
Journal of Combinatorial Theory. Series B
2020-04-22Paper
The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring
Journal of Combinatorial Theory. Series B
2020-04-22Paper
Maximum independent sets in (pyramid, even hole)-free graphs2019-12-24Paper
Triangle-free graphs that do not contain an induced subdivision of \(K_4\) are 3-colorable
Journal of Graph Theory
2019-10-31Paper
On the complexity of colouring antiprismatic graphs
(available as arXiv preprint)
2019-10-24Paper
The independent set problem is FPT for even-hole-free graphs
(available as arXiv preprint)
2019-07-01Paper
Coloring square-free Berge graphs
Journal of Combinatorial Theory. Series B
2019-02-08Paper
Coloring square-free Berge graphs
Journal of Combinatorial Theory. Series B
2019-02-08Paper
Coloring graphs with no induced subdivision of $K_4^+$2019-01-14Paper
On rank-width of (diamond, even-hole)-free graphs
(available as arXiv preprint)
2018-11-30Paper
On rank-width of (diamond, even-hole)-free graphs2018-11-30Paper
\(\chi\)-bounds, operations, and chords
Journal of Graph Theory
2018-07-13Paper
Connected greedy colouring in claw-free graphs2018-05-04Paper
Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
Algorithmica
2018-04-06Paper
Coloring Graphs with Constraints on Connectivity
Journal of Graph Theory
2017-08-10Paper
Coloring Graphs with Constraints on Connectivity
Journal of Graph Theory
2017-08-10Paper
Equistarable graphs and counterexamples to three conjectures on equistable graphs
Journal of Graph Theory
2017-04-21Paper
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
Journal of Graph Theory
2017-04-21Paper
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
Journal of Graph Theory
2017-04-21Paper
A polynomial Turing-kernel for weighted independent set in bull-free graphs
Algorithmica
2017-04-12Paper
A polynomial Turing-kernel for weighted independent set in bull-free graphs
Algorithmica
2017-04-12Paper
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions2016-10-17Paper
Perfect graphs2016-09-30Paper
Detecting wheels
Applicable Analysis and Discrete Mathematics
2016-06-27Paper
Isolating highly connected induced subgraphs
SIAM Journal on Discrete Mathematics
2016-04-07Paper
A decomposition theorem for {ISK4,wheel}-free trigraphs2016-02-07Paper
Perfect graphs of arbitrarily large clique-chromatic number
Journal of Combinatorial Theory. Series B
2015-12-11Paper
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
Discrete Applied Mathematics
2015-09-22Paper
A polynomial Turing-kernel for weighted independent set in bull-free graphs
Graph-Theoretic Concepts in Computer Science
2015-09-09Paper
Coloring perfect graphs with no balanced skew-partitions
Journal of Combinatorial Theory. Series B
2015-08-21Paper
Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
(available as arXiv preprint)
2015-08-03Paper
Wheel-free planar graphs
European Journal of Combinatorics
2015-06-18Paper
Vertex elimination orderings for hereditary graph classes
Discrete Mathematics
2015-01-30Paper
Detecting an induced net subdivision
Journal of Combinatorial Theory. Series B
2014-10-13Paper
Substitution and \(\chi\)-boundedness
Journal of Combinatorial Theory. Series B
2014-10-13Paper
Linear balanceable and subcubic balanceable graphs
Journal of Graph Theory
2014-01-28Paper
Edge-colouring and total-colouring chordless graphs
Discrete Mathematics
2014-01-20Paper
Complements of nearly perfect graphs
Journal of Combinatorics
2013-11-05Paper
Complements of nearly perfect graphs
Journal of Combinatorics
2013-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 digraph
Electronic Notes in Discrete Mathematics
2013-07-23Paper
Detecting 2-joins faster
Journal of Discrete Algorithms
2013-06-24Paper
Graphs that do not contain a cycle with a node that has at least two neighbors on it
SIAM Journal on Discrete Mathematics
2013-04-09Paper
Perfect graphs: a survey2013-01-22Paper
The chromatic gap and its extremes
Journal of Combinatorial Theory. Series B
2012-10-19Paper
Excluding induced subdivisions of the bull and related graphs
Journal of Graph Theory
2012-09-12Paper
On graphs with no induced subdivision of \(K_4\)
Journal of Combinatorial Theory. Series B
2012-08-14Paper
Finding an induced subdivision of a digraph
Theoretical Computer Science
2012-08-10Paper
Combinatorial optimization with 2-joins
Journal of Combinatorial Theory. Series B
2012-03-19Paper
On Roussel-Rubio-type lemmas and their consequences
Discrete Mathematics
2011-05-06Paper
Detecting induced subgraphs
Discrete Applied Mathematics
2010-04-28Paper
A structure theorem for graphs with no cycle with a unique chord and its consequences
Journal of Graph Theory
2010-03-15Paper
The four-in-a-tree problem in triangle-free graphs
Graphs and Combinatorics
2010-01-18Paper
Coloring Artemis graphs
Theoretical Computer Science
2009-05-28Paper
Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs
SIAM Journal on Discrete Mathematics
2009-03-16Paper
Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs
SIAM Journal on Discrete Mathematics
2009-03-16Paper
Detecting induced subgraphs
Electronic Notes in Discrete Mathematics
2008-06-05Paper
Decomposing Berge graphs and detecting balanced skew partitions
Journal of Combinatorial Theory. Series B
2007-12-10Paper
Decomposing Berge graphs and detecting balanced skew partitions
Journal of Combinatorial Theory. Series B
2007-12-10Paper
Algorithms for 3PC(⋅, ⋅)-free Berge graphs
Electronic Notes in Discrete Mathematics
2007-05-29Paper
On the structure of self-complementary graphs
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Odd pairs of cliques
(available as arXiv preprint)
2007-03-05Paper
Algorithms for Perfectly Contractile Graphs
SIAM Journal on Discrete Mathematics
2006-06-01Paper
A class of perfectly contractile graphs
Journal of Combinatorial Theory. Series B
2006-01-10Paper
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
European Journal of Combinatorics
2004-08-06Paper
Graphs without a 3-connected subgraph are 4-colorable
(available as arXiv preprint)
N/APaper
Detecting $K_{2,3}$ as an induced minor
(available as arXiv preprint)
N/APaper
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Nicolas Trotignon