Rocío Sánchez-López

most citedCycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2022★ 2 cited

Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions

Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana, Rocío Sánchez-López

Let $G$ be an edge-colored graph, a walk in $G$ is said to be a properly colored walk iff each pair of consecutive edges have different colors, including the first and the last edg…

math.CO2022

Strong in-domatic number in digraphs

Laura Pastrana-Ramírez, Rocío Sánchez-López, Miguel Tecpa-Galván

Let $D = (V, A)$ be a digraph and $S$ a partition of $V (D)$ . We say that $S$ is a strong in-domatic partition if every $S$ in $S$ holds that every ver…

math.CO2020

$H$ -kernels in $H$ -colored digraphs without $(ξ_{1}, ξ, ξ_{2})$ - $H$ -subdivisions of $C_{3}$

Felipe Hernández-Lorenzana, Rocío Sánchez-López

Let $H$ be a digraph possibly with loops and $D$ a digraph without loops with a coloring of its arcs $c : A (D) \to V (H)$ ( $D$ is said to be an $H$ -colored digraph). A directe…

Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions

Strong in-domatic number in digraphs

H-kernels in H-colored digraphs without (ξ1​,ξ,ξ2​)-H-subdivisions of C3​​

$H$ -kernels in $H$ -colored digraphs without $(ξ_{1}, ξ, ξ_{2})$ - $H$ -subdivisions of $C_{3}$