13 citations · 14 across the 3 of their papers we have counts for
4 papers
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…
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs
Nina Pardal, Guillermo A. Durán, Luciano N. Grippo +1
A -matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a $(0, 1)…
Neighborhood covering and independence on two superclasses of cographs
Guillermo Durán, Martín D. Safe, Xavier S. Warnes
Given a simple graph , a set is a neighborhood cover set if every edge and vertex of belongs to some with , where denotes the subgr…
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
L. Alcón, F. Bonomo, G. Durán +4
Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate…