Fernando Esteban Contreras-Mendoza

According to our database, Fernando Esteban Contreras-Mendoza authored at least 9 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Partitioning P5-free graphs into an independent set and a complete multipartite graph.

Germán Benítez-Bobadilla, Fernando Esteban Contreras-Mendoza, Juan Carlos García-Altamirano, César Hernández-Cruz, Juan José Montellano-Ballesteros

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2024

Minimal Obstructions for Polarity, Monopolarity, Unipolarity and (s, 1)-Polarity in Generalizations of Cographs.

Fernando Esteban Contreras-Mendoza, César Hernández-Cruz

Graphs Comb., May, 2024

2-polarity and algorithmic aspects of polarity variants on cograph superclasses.

Fernando Esteban Contreras-Mendoza, César Hernández-Cruz

Discret. Math. Theor. Comput. Sci., 2024

2023

Minimal obstructions for some matrix partitions on selected graph classes

Fernando Esteban Contreras-Mendoza

PhD thesis, 2023

Simple certifying algorithms for variants of the (2, 1)-colouring problem.

Fernando Esteban Contreras-Mendoza, César Hernández-Cruz

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Polarity on H-split graphs.

Fernando Esteban Contreras-Mendoza, César Hernández-Cruz

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2021

Minimal obstructions to (∞, k)-polarity in cographs.

Fernando Esteban Contreras-Mendoza, César Hernández-Cruz

Discret. Math., 2021

2020

Minimal obstructions to (s, 1)-polarity in cographs.

Fernando Esteban Contreras-Mendoza, César Hernández-Cruz

Discret. Appl. Math., 2020

2019

Complete colorings of planar graphs.

Gabriela Araujo-Pardo, Fernando Esteban Contreras-Mendoza, Sara J. Murillo-García, Andrea B. Ramos-Tort, Christian Rubio-Montiel

Discret. Appl. Math., 2019