H. Galeana-Sánchez

activity

20152019

collaborators

3 papers

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.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…

H-Kernels by Walks

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

On Panchromatic Patterns

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