Abstract
This project aims at introducing the student to the area of Graph Theory through the study of two variants of Lights Out game, namely Red-Green and Module-3. The project also intent to approach these variants for some classes of graphs.
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
graduation at Matemática Aplicada e Computacional from Universidade Estadual de Campinas (1994) and doctorate at Computer Science from Universidade Estadual de Campinas (2006). Has experience in Computer Science, focusing on Graph Theory, acting on the following subjects: total colouring, total chromatic number, total colouring conjecture, coloração total and powers of cycles. (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) |
This project aims at introducing the student to the area of Graph Theory through the study of two variants of Lights Out game, namely Red-Green and Module-3. The project also intent to approach these variants for some classes of graphs.
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 undergraduate research project aims at introducing the student to Graph Theory research, through the study of the conjecture which states that any three longest paths in a connected graph have a vertex in common. This problem was motivated by a question of T. Gallai in 1968 and touches on important aspects of Graph Theory, such as connectivity and structures of paths. The focus of th…
(Only some records are available in English at this moment)
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 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 three selected structural problems in Graph Theory: the 1,2-Conjecture; Ruskey and Savagge's Conjecture; and the Graceful Tree Conjecture. (AU)
The aim of this project is to describe the planned activities for the student during her stay in the Department of Combinatorics and Optimization of the University of Waterloo, Canada. The activities are comprised by the participation in the Undergraduate Research Assistantship, taking three undergraduate courses, and regular research meetings with her supervisor there. (AU)
(Only some records are available in English at this moment)
1 / 1 | Completed research grants |
8 / 5 | Completed scholarships in Brazil |
4 / 4 | Completed scholarships abroad |
13 / 10 | All research grants and scholarships |
Associated processes |