8 citations · 32 across the 9 of their papers we have counts for
6 papers · 1 filter
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
Flavia Bonomo-Braberman, Gastón Abel Brito
The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most…
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…
Precedence thinness in graphs
Flavia Bonomo-Braberman, Fabiano S. Oliveira, Moysés S. Sampaio +1
Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been pro…
Thinness of product graphs
Flavia Bonomo-Braberman, Carolina L. Gonzalez, Fabiano S. Oliveira +2
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be sol…
A new approach on locally checkable problems
Flavia Bonomo-Braberman, Carolina Lucía Gonzalez
By providing a new framework, we extend previous results on locally checkable problems in bounded treewidth graphs. As a consequence, we show how to solve, in polynomial time for b…
Characterising circular-arc contact -VPG graphs
Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez
A contact -VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence wi…