H. Galeana-Sánchez

activity

20122019

most citedOn the existence and number of

(k + 1)

-kings in

k

-quasi-transitive digraphs

14 citations · 19 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2019

H-Kernels by Walks

Hortensia Galeana-Sanchez, Hugo Rincon-Galeana, Ricardo Strausz

We prove that, if every cycle of $D$ is an $H$ -cycle, then $D$ has an $H$ -kernel by walks.

math.CO2018★ 1 cited

New Bounds for the Dichromatic Number of a Digraph

Narda Cordero-Michel, Hortensia Galeana-Sánchez

The chromatic number of a graph $G$ , denoted by $χ (G)$ , is the minimum $k$ such that $G$ admits a $k$ -coloring of its vertex set in such a way that each color class is an independe…

math.CO2018★ 1 cited

Alternating Hamiltonian cycles in $2$ -edge-colored multigraphs

Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder

A path (cycle) in a $2$ -edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian…

math.CO2017★ 2 cited

Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments

H. Galeana-Sánchez, M. Olsen

A digraph such that every proper induced subdigraph has a kernel is said to be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI for short) resp.) if the…

math.CO2016

A dichotomy for the kernel by $H$ -walks problem in digraphs

Hortensia Galeana-Sánchez, César Hernández-Cruz

Let $H = (V_{H}, A_{H})$ be a digraph which may contain loops, and let $D = (V_{D}, A_{D})$ be a loopless digraph with a coloring of its arcs $c : A_{D} \to V_{H}$ . An $H$ -walk of $D$ is a walk…

math.CO2015

On Panchromatic Patterns

Hortensia Galeana-Sanchez, Ricardo Strausz

Given D and H two digraphs, D is H-coloured iff the arcs of D are coloured with the vertices of H. After defining what do we mean by an H-walk in the coloured D, we characterise th…

math.CO2012★ 14 cited

On the existence and number of $(k + 1)$ -kings in $k$ -quasi-transitive digraphs

Hortensia Galeana-Sánchez, César Hernández-Cruz, Manuel Alejandro Juárez-Camacho

Let $D = (V (D), A (D))$ be a digraph and $k \geq 2$ an integer. We say that $D$ is $k$ -quasi-transitive if for every directed path $(v_{0}, v_{1}, ..., v_{k})$ in $D$ , then $(v_0, v_k) \in A(…

math.CO2012★ 1 cited

k-colored kernels

Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros

We study $k$ -colored kernels in $m$ -colored digraphs. An $m$ -colored digraph $D$ has $k$ -colored kernel if there exists a subset $K$ of its vertices such that (i) from every vertex…