activity
20132024
most citedA tamed family of triangle-free graphs with unbounded chromatic number

2 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

math.CO2023★ 1 cited

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor

Édouard Bonnet, Jędrzej Hodor, Tuukka Korhonen +1

A graph contains a graph as an induced minor if can be obtained from after vertex deletions and edge contractions. We show that for every -vertex planar graph $H…

math.CO2023★ 2 cited

A tamed family of triangle-free graphs with unbounded chromatic number

Édouard Bonnet, Romain Bourneuf, Julien Duron +3

We construct a hereditary class of triangle-free graphs with unbounded chromatic number, in which every non-trivial graph either contains a pair of non-adjacent twins or has an edg…