29 citations · 334 across the 88 of their papers we have counts for
Showing 2019 · cs.DMShow all
2 papers · 2 filters
cs.DM2019★ 3 cited
Maximum independent sets in (pyramid, even hole)-free graphs
Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon +1
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-free} if it does not contain a hole on an even number of vertices. A \emph{pyramid…
cs.DM2019★ 1 cited
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five
Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk +1
A hole in a graph is an induced cycle of length at least , and an antihole is the complement of an induced cycle of length at least . A hole or antihole is long if its length…