A Class of Three-Colorable Triangle-Free Graphs ⬇️

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs ⬇️

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs ⬇️

Algorithms for 3PC(⋅, ⋅)-free Berge graphs ⬇️

Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs ⬇️

Balanced matrices ⬇️

Clique cutsets beyond chordal graphs ⬇️

Coloring perfect graphs with no balanced skew-partitions ⬇️

Coloring square-free Berge graphs ⬇️

Combinatorial optimization with 2-joins ⬇️

Decomposition of even-hole-free graphs with star cutsets and 2-joins ⬇️

article published in 2013

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins ⬇️

Detecting 2-joins faster

Even-hole-free graphs part I: Decomposition theorem ⬇️

Even-hole-free graphs part II: Recognition algorithm ⬇️

article published in 2002

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences ⬇️

Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It ⬇️

article by Pierre Aboulker et al published January 2012 in SIAM Journal on Discrete Mathematics

Linear Balanceable and Subcubic Balanceable Graphs*

On Roussel–Rubio-type lemmas and their consequences

On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph ⬇️

Perfect Graphs, Partitionable Graphs and Cutsets

Recognizing Berge Graphs

Square-free perfect graphs ⬇️

Structure and algorithms for (cap, even hole)-free graphs ⬇️

The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs ⬇️

The graph sandwich problem for 1-join composition is NP-complete

article

Triangle‐free graphs that do not contain an induced subdivision of K 4 are 3‐colorable ⬇️

Triangulated neighborhoods in even-hole-free graphs ⬇️

Vertex elimination orderings for hereditary graph classes ⬇️