28 citations · 54 across the 20 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
Covering graphs with convex sets and partitioning graphs into convex sets
Lucía M. González, Luciano N. Grippo, Martín D. Safe +1
We present some complexity results concerning the problems of covering a graph with convex sets and of partitioning a graph into convex sets. The following convexities are…
cs.DM2019★ 1 cited
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)…
math.CO2019
Circularly compatible ones, -circularity, and proper circular-arc bigraphs
Martín D. Safe
In 1969, Alan Tucker characterized proper circular-arc graphs as those graphs whose augmented adjacency matrices have the circularly compatible ones property. Moreover, he also fou…