66 citations · 323 across the 55 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021★ 2 cited
Treewidth versus clique number. II. Tree-independence number
Clément Dallard, Martin Milanič, Kenny Štorgel
In 2020, we initiated a systematic study of graph classes in which the treewidth can only be large due to the presence of a large clique, which we call -bounded. W…
math.CO2021★ 1 cited
Graphs with at most two moplexes
Clément Dallard, Robert Ganian, Meike Hatzel +2
A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two mopl…