28 citations · 54 across the 20 of their papers we have counts for
21 papers
Characterization and linear-time recognition of balanced distance-hereditary graphs
Lucía Busolini, Guillermo Durán, Martín D. Safe
A graph is balanced if its clique-matrix contains no square submatrix of odd order with exactly two 's in each row and in each column. Although it is known that a graph is balan…
Nonexistence of uniformly most reliable graphs of least corank
Pablo Romero, Martín D. Safe
If is a simple graph and , the reliability is the probability of being connected after each of its edges is removed independently with probability .…
Lochs-type theorems beyond positive entropy
Valérie Berthé, Eda Cesaratto, Pablo Rotondo +1
Lochs' theorem and its generalizations are conversion theorems that relate the number of digits determined in one expansion of a real number as a function of the number of digits g…
On the generalized Helly property of hypergraphs, cliques, and bicliques
Mitre C. Dourado, Luciano N. Grippo, Martín D. Safe
A family of sets is -intersecting if every nonempty subfamily of or fewer sets has at least elements in its total intersection. A family of sets has the -Hell…
2-nested matrices: towards understanding the structure of circle graphs
Guillermo Durán, Nina Pardal, Martín D. Safe
A -matrix has the consecutive-ones property (C1P) if its columns can be permuted to make the 's in each row appear consecutively. This property was characterised in terms…
Forbidden induced subgraph characterization of circle graphs within split graphs
Flavia Bonomo-Braberman, Guillermo A. Durán, Nina Pardal +1
A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the correspon…