115 citations · 430 across the 53 of their papers we have counts for
4 papers · 1 filter
Clique covers of H-free graphs
Tung Nguyen, Alex Scott, Paul Seymour +1
It takes cliques to cover all the edges of a complete bipartite graph , but how many cliques does it take to cover all the edges of a graph if has no $…
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…
Twin-width VII: groups
Édouard Bonnet, Colin Geniet, Romain Tessera +1
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-widt…
Twin-width VIII: delineation and win-wins
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim +3
We introduce the notion of delineation. A graph class is said delineated if for every hereditary closure of a subclass of , it holds that $\ma…