5 citations · 10 across the 6 of their papers we have counts for
6 papers
Star Coloring on Some Subclasses of Chordal Graphs
Germán Benítez-Bobadilla, Fernando Esteban Contreras-Mendoza, César Hernández-Cruz +2
A star coloring of a graph is a proper coloring in which no path on four vertices is bicolored. The star chromatic number is the minimum number of colors in a st…
-polarity and algorithmic aspects of polarity variants on cograph superclasses
Fernando Esteban Contreras-Mendoza, César Hernández-Cruz
A graph is said to be an -polar graph if its vertex set admits a partition such that and induce, respectively, a complete -partite graph and the dis…
Minimal obstructions for polarity, monopolarity, unipolarity and -polarity in generalizations of cographs
Fernando Esteban Contreras-Mendoza, César Hernández-Cruz
It is known that every hereditary property can be characterized by finitely many minimal obstructions when restricted to either the class of cographs or the class of -reducibl…
Minimal obstructions to -polarity in cographs
F. Esteban Contreras-Mendoza, César Hernández-Cruz
Let be nonnegative integers. A graph is -polar if its vertex set admits a partition such that induces a complete multipartite graph with at most pa…
Minimal obstructions to -polarity in cographs
F. Esteban Contreras-Mendoza, César Hernández-Cruz
A graph is a cograph if it does not contain a 4-vertex path as an induced subgraph. An -polar partition of a graph is a partition of its vertex set such that $…
Complete colorings of planar graphs
M. Gabriela Araujo-Pardo, F. Esteban Contreras-Mendoza, Sara J. Murillo-García +2
In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We gi…