8 citations · 32 across the 9 of their papers we have counts for
10 papers
Computing parameters that generalize interval graphs using restricted modular partitions
Flavia Bonomo-Braberman, Eric Brandwein, Ignasi Sau
Recently, Lafond and Luo [MFCS 2023] defined the -modular cardinality of a graph as the minimum size of a partition of into modules that belong to a graph c…
On the thinness of trees
Flavia Bonomo-Braberman, Eric Brandwein, Carolina Lucía González +1
The study of structural graph width parameters like tree-width, clique-width and rank-width has been ongoing during the last five decades, and their algorithmic use has also been i…
Thinness and its variations on some graph families and coloring graphs of bounded thinness
Flavia Bonomo-Braberman, Eric Brandwein, Fabiano S. Oliveira +3
Interval graphs and proper interval graphs are well known graph classes, for which several generalizations have been proposed in the literature. In this work, we study the (proper)…
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…
Linear-time Algorithms for Eliminating Claws in Graphs
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano S. Oliveira +2
Since many NP-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given grap…
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…