The following pages link to Nicolas Trotignon (Q442236):
Displaying 50 items.
- (Q324768) (redirect page) (← links)
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- Complements of nearly perfect graphs (Q376556) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Detecting an induced net subdivision (Q461729) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- On Roussel-Rubio-type lemmas and their consequences (Q533774) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- The four-in-a-tree problem in triangle-free graphs (Q844235) (← links)
- Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets (Q1827343) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- Wheel-free planar graphs (Q2349958) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- On the complexity of colouring antiprismatic graphs (Q2659773) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- Burling graphs revisited. I: New characterizations (Q2700996) (← links)
- Isolating highly connected induced subgraphs (Q2801334) (← links)
- Detecting wheels (Q2815233) (← links)
- Perfect graphs (Q2822594) (← links)
- Linear balanceable and subcubic balanceable graphs (Q2874096) (← links)
- Excluding induced subdivisions of the bull and related graphs (Q2911052) (← links)
- A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs (Q2945208) (← links)
- On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph (Q2978173) (← links)
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs (Q2978190) (← links)
- Odd pairs of cliques (Q3424772) (← links)
- Algorithms for 3PC(⋅, ⋅)-free Berge graphs (Q3439311) (← links)
- On the structure of self-complementary graphs (Q3439312) (← links)
- Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs (Q3614194) (← links)
- On rank-width of even-hole-free graphs (Q4558968) (← links)
- χ‐bounds, operations, and chords (Q4575535) (← links)
- Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It (Q4915184) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239) (← links)
- Triangle‐free graphs that do not contain an induced subdivision of <i>K</i><sub>4</sub> are 3‐colorable (Q5241606) (← links)
