8 citations · 32 across the 9 of their papers we have counts for
3 papers · 1 filter
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…
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…