3 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 s…
Long-eared digraphs
Germán BenÃtez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz
Let be a subdigraph of a digraph . An ear of in is a path or a cycle in whose ends lie in but whose internal vertices do not. An \emph{ear decomposition} of…
Critical Kernel Imperfectness in -quasi-transitive and -anti-transitive digraphs of small diameter
Germán BenÃtez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz
A kernel in a digraph is an independent and absorbent subset of its vertex set. A digraph is critical kernel imperfect if it does not have a kernel, but every proper induced subdig…