activity
20122021
most cited-colored kernels in semicomplete multipartite digraphs

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

collaborators
Showing math.COShow all

8 papers · 1 filter

math.CO2021

-kernels in nearly tournaments

Hortensia Galeana-Sánchez, Miguel Tecpa-Galván

Let be a digraph possibly with loops, a digraph without loops, and a coloring of ( is said to be an -colored digraph). If $W=(x_{0},…

math.CO2021

On -kernels by walks and the H-class digraph

Hortensia Galeana-Sánchez, Miguel Tecpa-Galván

Let be a digraph possibly with loops and a digraph without loops whose arcs are colored with the vertices of ( is said to be an colored digraph). If $W=(x_{0},\l…

math.CO2021

Pancyclism in the Generalized Sum of Digraphs

Narda Cordero-Michel, Hortensia Galeana-Sánchez

A digraph of order is pancyclic, whenever contains a directed cycle of length for each ; and D is vertex-pancyclic iff, for each vertex…

math.CO2020

Vertex-Pancyclism in the Generalized Sum of Digraphs

N. Cordero-Michel, H. Galeana-Sánchez

A digraph , of order is pancyclic, whenever contains a directed cycle of length for each ; and is vertex-pancyclic iff,…

math.CO2019

Vertex Alternating-Pancyclism in 2-Edge-Colored Graphs

Narda Cordero-Michel, Hortensia Galeana-Sánchez

An alternating cycle in a 2-two-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let be a collection of pairwise vertex d…

math.CO2019

Panchromatic patterns by paths

Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz

Let be a digraph, possibly with loops, and let be a loopless multidigraph with a colouring of its arcs . An -path of is…

math.CO2019

Semi-Grundy function, an hereditary approach to Grundy function

Hortensia Galeana-Sánchez, Raúl González-Silva

Grundy functions have found many applications in a wide variety of games, in solving relevant problems in Game Theory. Many authors have been working on this topic for over many ye…

math.CO2012★ 1 cited

-colored kernels in semicomplete multipartite digraphs

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

An -colored digraph has -colored kernel if there exists a subset of its vertices such that for every vertex there exists an at most -colored directed…