3 papers
math.CO2026
A characterization of interval nest digraphs
Ayelén Alcantar, Flavia Bonomo, Guillermo Durán +1
A digraph consisting of a set of vertices and a set of arcs is called an interval digraph if there exists a family of closed intervals such that $uv…
math.CO2025
Trees with proper thinness 2
Flavia Bonomo-Braberman, Ignacio Maqueda, Nina Pardal
The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with pro…
cs.DM2025
Exploring subgraph complementation to bounded degree graphs
Ivo Koch, Nina Pardal, Vinicius F. dos Santos
Graph modification problems are computational tasks where the goal is to change an input graph using operations from a fixed set, in order to make the resulting graph satisfy a…