8 citations · 9 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2022★ 8 cited
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Marthe Bonamy, Édouard Bonnet, Hugues Déprés +5
A graph is -free if it does not contain pairwise vertex-disjoint and non-adjacent cycles. We prove that "sparse" (here, not containing large complete bipartite g…
math.CO2022★ 1 cited
Twin-width can be exponential in treewidth
Édouard Bonnet, Hugues Déprés
For any small positive real and integer , we build a graph with a vertex deletion set of size to a tree, and twin-width greater than $2…
math.CO2019
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments
Jørgen Bang-Jensen, Hugues Depres, Anders Yeo
A digraph is {\bf eulerian} if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a ham…