115 citations · 430 across the 53 of their papers we have counts for
22 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…
The independent set problem is FPT for even-hole-free graphs
Edin Husic, Stephan Thomasse, Nicolas Trotignon
The class of even-hole-free graphs is very similar to the class of perfect graphs, and was indeed a cornerstone in the tools leading to the proof of the Strong Perfect Graph Theore…
Convexly independent subsets of Minkowski sums of convex polygons
Mateusz Skomra, Stéphan Thomassé
We show that there exist convex -gons and such that the largest convex polygon in the Minkowski sum has size . This matches an upper bound of Tiwary.
Edge-decomposing graphs into coprime forests
Tereza Klimošová, Stéphan Thomassé
The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A proof of the Barat-Thomassen conjecture. J. Combin. Theory Ser. B, 124:39-55, 2017.], asserts that for every…
Separation choosability and dense bipartite induced subgraphs
Louis Esperet, Ross J. Kang, Stéphan Thomassé
We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that…