Abstract
This project aims at the study of several classical problems involving graph coloring. For this, several combinatorial techniques, both finite and infinite, will be studied. (AU)
Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Luan Arjuna Fraga Ramires in research grants and scholarships supported by FAPESP.
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) |
This project aims at the study of several classical problems involving graph coloring. For this, several combinatorial techniques, both finite and infinite, will be studied. (AU)
1 / 1 | Completed scholarships in Brazil |
Associated processes |