research
∙
12/22/2021
Burling graphs revisited, part III: Applications to χ-boundedness
The Burling sequence is a sequence of triangle-free graphs of unbounded ...
share
research
∙
04/14/2021
Burling graphs revisited – Part 1 New characterizations
The Burling sequence is a sequence of triangle-free graphs of increasing...
research
∙
08/12/2020
On the tree-width of even-hole-free graphs
The class of all even-hole-free graphs has unbounded tree-width, as it c...
research
∙
07/22/2020
A class of graphs with large rankwidth
We describe several graphs of arbitrarily large rankwidth (or equivalent...
research
∙
01/06/2020
(Theta, triangle)-free and (even hole, K_4)-free graphs. Part 2 : bounds on treewidth
A theta is a graph made of three internally vertex-disjoint chordless p...
research
∙
12/24/2019
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 ...
research
∙
10/24/2019
On the complexity of colouring antiprismatic graphs
A graph G is prismatic if for every triangle T of G, every vertex of G n...
research
∙
06/26/2019
(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...
research
∙
05/04/2018
Connected greedy colouring in claw-free graphs
An ordering of the vertices of a graph is connected if every vertex (but...
research
∙
09/05/2013
