Some labelling problems on graphs

• Grant number: 15/03372-1
• Support Opportunities: Scholarships abroad - Research Internship - Doctorate
• Start date: June 17, 2015
• End date: June 16, 2016
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Christiane Neme Campos
• Grantee: Atilio Gomes Luiz
• Supervisor: R. Bruce Richter
• Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
• Institution abroad: University of Waterloo, Canada
• Associated to the scholarship: 14/16861-8 - Problems on graph labelling, BP.DR

Abstract

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 every graph G, its choice number is less than or equal to its group chromatic number. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

LUIZ, ATILIO G.; CAMPOS, C. N.; RICHTER, R. BRUCE. On 0-Rotatable Graceful Caterpillars. GRAPHS AND COMBINATORICS, SEP 2020. (14/16987-1, 15/03372-1, 14/16861-8)

LUIZ, ATILIO G.; CAMPOS, C. N.; RICHTER, R. BRUCE. On alpha-labellings of lobsters and trees with a perfect matching. DISCRETE APPLIED MATHEMATICS, v. 268, p. 137-151, SEP 15 2019. (14/16987-1, 15/03372-1, 14/16861-8)

LUIZ, ATILIO G.; CAMPOS, C. N.; RICHTER, R. BRUCE. On 0-Rotatable Graceful Caterpillars. GRAPHS AND COMBINATORICS, v. 36, n. 6, p. 19-pg., 2020-09-03. (14/16861-8, 14/16987-1, 15/03372-1)