3 citations · 3 across the 1 of their papers we have counts for
3 papers
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…
math.CO2019
Coloring rings
Frédéric Maffray, Irena Penev, Kristina Vušković
A ring is a graph whose vertex set can be partitioned into nonempty sets, , such that for all , the set can be ordered as…
math.CO2017
Clique-cutsets beyond chordal graphs
Valerio Boncompagni, Irena Penev, Kristina Vuskovic
Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and…