Raquel S. F. Bravo

According to our database, Raquel S. F. Bravo authored at least 9 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Near-bipartiteness on graphs having small dominating sets.

Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo A. Oliveira, Uéverton S. Souza

J. Comb. Optim., December, 2025

Characterizations and recognition algorithms for distance-hereditary graphs partitionable into a stable set and a forest.

Maria Luíza L. da Cruz, Victor R. Ramos, Rodolfo A. Oliveira, Raquel S. F. Bravo, Uéverton S. Souza

J. Braz. Comput. Soc., 2025

2023

Partitioning P4-tidy graphs into a stable set and a forest.

Raquel S. F. Bravo, Rodolfo A. Oliveira, Fábio da Silva, Uéverton S. Souza

Discret. Appl. Math., October, 2023

Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets.

Maria Luíza L. da Cruz, Raquel S. F. Bravo, Rodolfo A. Oliveira, Uéverton S. Souza

Proceedings of the Combinatorial Optimization and Applications, 2023

2020

Factors Afecting Female Students Motivation Related to Enrollment and Retention in Information Technology Courses.

Meirylane Rosa Emidio Avelino, Luciana Cardoso de Castro Salgado, Karina Mochetti, Raquel S. F. Bravo, Carla Faria Leitão

CLEI Electron. J., 2020

2019

A General Framework for Path Convexities.

João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2013

Clique cycle transversals in graphs with few P₄'s.

Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Discret. Math. Theor. Comput. Sci., 2013

2012

Partitioning extended P₄-laden graphs into cliques and stable sets.

Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti, Rudini Menezes Sampaio

Inf. Process. Lett., 2012

2011

Characterization and recognition of P₄-sparse graphs partitionable into k independent sets and <i>l</i> cliques.

Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Discret. Appl. Math., 2011