3 citations · 4 across the 2 of their papers we have counts for
4 papers · 1 filter
Bisimplicial separators
Martin Milanič, Irena Penev, Nevena Pivač +1
A minimal separator of a graph is a set such that there exist vertices with the property that separates from in , b…
When all holes have the same length
Jake Horsfield, Myriam Preissmann, Cléophée Robin +3
For every integer , we give a structural description of the class of graphs whose chordless cycles of length at least 4 all have length .
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…
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…