8 citations · 25 across the 33 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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…
math.CO2021★ 2 cited
Tuza's Conjecture for Threshold Graphs
Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik +4
Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjoint triangles, it suffices to delete at most 2k edges to obtain a triangle-free graph. The conjecture holds…