Atilio Gomes Luiz 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 is the postdoctoral research project of Atílio Gomes Luiz, to be carried out under the supervision of Professor Yoshiko Wakabayashi at the Institute of Mathematics and Statistics of the University of São Paulo. This project addresses topics in Graph Theory, more specifically, graph labelling problems. Graph labelling is the assignment of labels, usually nonnegative integers, to the e…
This is the PhD project of Atílio Gomes Luiz, student at the Institute of Computing of the University of Campinas. It will be conducted under the supervision of Professor Christiane Neme Campos. The project is in the area of Graph Theory, more specifically on graph labellings, which are assignments of positive integers to the elements of a graph, subject to certain conditions. The researc…
This is a research project to request a master scholarship for Atílio Gomes Luiz. It is proposed to investigate a total-coloring variant called adjacent-vertex-distinguishing-total-coloring(AVD-total-coloring). Given a total-coloring, we label each vertex of a graph with the set of colors appearing on the vertex and incidentedges. When these sets are distinct for any two adjacent vertices…
This is a research project to be developed at the Combinatorics and Optimization Department of the University of Waterloo, Canada, under the supervision of Prof. R. B. Richter. The project approaches two conjectures in Graph Theory: the Graceful Tree Conjecture, which states that every tree admits a graceful labelling; and a conjecture posed by Král et al. in 2005, which states that, for …
This is a research project to request a research internship abroad scholarship for Atílio Gomes Luiz, associated to process 2012/105623. It is proposed to investigate the Albertson's conjecture, which relates the chromatic number and crossing number of a graph. In 2007, Michael Albertson conjectured that if a graph G has chromatic number r, then its crossing number is at least as much as …
| 3 / 3 | Completed scholarships in Brazil |
| 2 / 2 | Completed scholarships abroad |
| 5 / 5 | All Scholarships |
| Associated processes | |
CV Lattes
ORCID