CONTRERAS MENDOZA, FERNANDO ESTEBAN

I received my B.Sc. in Mathematics from the Faculty of Sciences at the National Autonomous University of Mexico (UNAM) in 2015, and my M.Sc. and Ph.D. from the Graduate Program in Mathematical Sciences at UNAM in 2018 and 2023, respectively. During my undergraduate studies, I developed a strong interest in Graph Theory, which has guided my academic training ever since.

My research record includes six peer-reviewed publications and contributed talks at international conferences, including the International Colloquium on Graph Theory and Combinatorics, the Canadian Discrete and Algorithmic Mathematics Conference, and the Latin-American Algorithms, Graphs, and Optimization Symposium.

In terms of teaching and academic mentorship, I hold a Diploma in University Teaching from FES Zaragoza, UNAM (2020). I have taught sixteen undergraduate courses as a part-time lecturer at the Faculty of Sciences, supervised an undergraduate thesis, and served as an examiner on undergraduate thesis committees. I have also been a member of the Academic Committee of Discrete Mathematics during the revision of the syllabus of the undergraduate Mathematics program at the Faculty of Sciences, UNAM (2025).

I am currently a postdoctoral researcher at the Institute of Mathematics, UNAM. My current work focuses on generalizations of graph colorings, structural characterizations of graph classes, and the design of certifying recognition algorithms for selected families of graphs.

My research interests lie primarily in Structural Graph Theory, domination, and graph colorings. More broadly, I am interested in most areas of graph and digraph theory, as well as in further topics within combinatorics.