Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques. - Raquel S. F. Bravo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Discret. Appl. Math., 2011)

Partitioning extended P4-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)

Clique cycle transversals in graphs with few P4's. - Raquel S. F. Bravo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Discret. Math. Theor. Comput. Sci., 2013)

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 (J. Comb. Optim., 2022)

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 Oliveira; Uéverton S. Souza (COCOA (1), 2023)

Partitioning P4-tidy graphs into a stable set and a forest. - Raquel S. F. Bravo; Rodolfo Oliveira; Fábio da Silva; Uéverton S. Souza (Discret. Appl. Math., 2023)

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 Oliveira; Raquel S. F. Bravo; Uéverton S. Souza (J. Braz. Comput. Soc., 2025)