
Burling graphs revisited – Part 1 New characterizations
The Burling sequence is a sequence of trianglefree graphs of increasing...
read it

On the treewidth of evenholefree graphs
The class of all evenholefree graphs has unbounded treewidth, as it c...
read it

A class of graphs with large rankwidth
We describe several graphs of arbitrarily large rankwidth (or equivalent...
read it

(Theta, triangle)free and (even hole, K_4)free graphs. Part 2 : bounds on treewidth
A theta is a graph made of three internally vertexdisjoint chordless p...
read it

Maximum independent sets in (pyramid, even hole)free graphs
A hole in a graph is an induced cycle with at least 4 vertices. A graph ...
read it

On the complexity of colouring antiprismatic graphs
A graph G is prismatic if for every triangle T of G, every vertex of G n...
read it

(Theta, triangle)free and (even hole, K_4)free graphs. Part 1 : Layered wheels
We present a construction called layered wheel. Layered wheels are graph...
read it

Connected greedy colouring in clawfree graphs
An ordering of the vertices of a graph is connected if every vertex (but...
read it

The kinatree problem for graphs of girth at least k
For all integers k≥ 3, we give an O(n^4) time algorithm for the problem ...
read it
Nicolas Trotignon
is this you? claim profile