Currently, she is a PhD student in Computer Science at the State University of Campinas. She holds a degree in Computer Science from the Federal University of São Carlos (2019) and a Master's in Computer Science from the State University of Campinas (2022). She has experience in the field of Computer Science, with an emphasis on Graph Theory. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
In 1982, Berge defined two classes of digraphs in order to identify properties on the relation between stable sets and paths in digraphs. The first class that Berge defined is the class of $\alpha$-diperfect digraphs. A digraph $D$ is $\alpha$-diperfect if every induced subdigraph $D'$ of $D$ satisfies the following property: for every maximum stable set $S$ of $D'$ there is a path partit…
Let $D$ be a digraph. A coloring $\cal{C}$ and a path $P$ of $D$ are \emph{orthogonal} if $P$ contains exactly one vertex of each color class in $\cal{C}$. In 1982, Berge defined the class of $\chi$-diperfect digraphs. A digraph $D$ is $\chi$-diperfect if for every optimal coloring $\cal{C}$ of $D$ there exists a path $P$ orthogonal to $\cal{C}$ and this property holds for every induced s…
In 1982, Berge proposed a conjecture on directed graphs which relates directed path partitions and collections of disjoint independent sets. Berge also showed the validity of his conjecture for certain classes of graphs. In face of his observations, it is a natural question whether one similar relation exists when the roles of paths and independent sets are switched. The natural question …
In problems of universality and madericity of digraphs we are interested in obtaining sufficient conditions for a digraph to contain a certain fixed subdigraph.Formally, for a digraph parameter $\gamma$, we say that a digraph $F$ is $\gamma$-universal if there is an integer $c = c(F)$ such that every digraph $D$ with $\gamma(D) \geq c$ contains $F$ as a subdigraph. Similarly, we say that …
| 3 / 3 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 4 / 4 | All Scholarships |
| Associated processes | |
CV Lattes
ORCID