3 citations · 4 across the 3 of their papers we have counts for
5 papers
When all holes have the same length
Jake Horsfield, Myriam Preissmann, Cléophée Robin +3
For every integer , we give a structural description of the class of graphs whose chordless cycles of length at least 4 all have length .
Maximum independent sets in (pyramid, even hole)-free graphs
Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon +1
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-free} if it does not contain a hole on an even number of vertices. A \emph{pyramid…
The independent set problem is FPT for even-hole-free graphs
Edin Husic, Stephan Thomasse, Nicolas Trotignon
The class of even-hole-free graphs is very similar to the class of perfect graphs, and was indeed a cornerstone in the tools leading to the proof of the Strong Perfect Graph Theore…
Coloring graphs with no induced subdivision of
Louis Esperet, Nicolas Trotignon
Let be the 5-vertex graph obtained from , the complete graph on four vertices, by subdividing one edge precisely once (i.e. by replacing one edge by a path on three ve…
Connected greedy colouring in claw-free graphs
Ngoc Khang Le, Nicolas Trotignon
An ordering of the vertices of a graph is \emph{connected} if every vertex (but the first) has a neighbor among its predecessors. The greedy colouring algorithm of a graph with a c…