A counterexample to a conjecture of meyniel on kernel-perfect graphs. - Hortensia Galeana-Sánchez (Discret. Math., 1982)

On kernels and semikernels of digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1984)

A theorem about a conjecture of H. Meyniel on kernel-perfect graphs. - Hortensia Galeana-Sánchez (Discret. Math., 1986)

On kernel-perfect critical digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1986)

A new method to extend kernel-perfect graphs to kernel-perfect critical graphs. - Hortensia Galeana-Sánchez (Discret. Math., 1988)

On the existence of (k, l)-kernels in digraphs. - Hortensia Galeana-Sánchez (Discret. Math., 1990)

Orientations of graphs in kernel theory. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1991)

Extending kernel perfect digraphs to kernel perfect critical digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1991)

Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph. - Hortensia Galeana-Sánchez; Laura Pastrana Ramírez; Hugo Alberto Rincón-Mejía (SIAM J. Discret. Math., 1991)

On the existence of kernels and h-kernels in directed graphs. - Hortensia Galeana-Sánchez (Discret. Math., 1992)

Normal fraternally orientable graphs satisfy the strong perfect graph conjecture. - Hortensia Galeana-Sánchez (Discret. Math., 1993)

New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Graphs Comb., 1994)

B1- and B2-orientable graphs in kernel theory. - Hortensia Galeana-Sánchez (Discret. Math., 1995)

Cycle-pancyclism in tournaments I. - Hortensia Galeana-Sánchez; Sergio Rajsbaum (Graphs Comb., 1995)

On monochromatic paths and monochromatic cycles in edge coloured tournaments. - Hortensia Galeana-Sánchez (Discret. Math., 1996)

Independent sets which meet all longest paths. - Hortensia Galeana-Sánchez; Hugo Alberto Rincón-Mejía (Discret. Math., 1996)

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 1996)

Cycle-pancyclism in tournaments II. - Hortensia Galeana-Sánchez; Sergio Rajsbaum (Graphs Comb., 1996)

On claw-free M-oriented critical kernel-imperfect digraphs. - Hortensia Galeana-Sánchez (J. Graph Theory, 1996)

A characterization of normal fraternally orientable perfect graphs. - Hortensia Galeana-Sánchez (Discret. Math., 1997)

Cycle-pancyclism in tournaments III. - Hortensia Galeana-Sánchez; Sergio Rajsbaum (Graphs Comb., 1997)

Kernels in edge-colored digraphs. - Hortensia Galeana-Sánchez (Discret. Math., 1998)

Kernels in a special class of digraphs. - Hortensia Galeana-Sánchez; Xueliang Li 001 (Discret. Math., 1998)

On independent sets and non-augmentable paths in directed graphs. - Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 1998)

New classes of critical kernel-imperfect digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 1998)

Kernels in edge coloured line digraph. - Hortensia Galeana-Sánchez; Laura Pastrana Ramírez (Discuss. Math. Graph Theory, 1998)

A sufficient condition for the existence of k-kernels in digraphs. - Hortensia Galeana-Sánchez; Hugo Alberto Rincón-Mejía (Discuss. Math. Graph Theory, 1998)

A conjecture on cycle-pancyclism in tournaments. - Hortensia Galeana-Sánchez; Sergio Rajsbaum (Discuss. Math. Graph Theory, 1998)

Semikernels and (k, l)-Kernels in Digraphs. - Hortensia Galeana-Sánchez; Xueliang Li 001 (SIAM J. Discret. Math., 1998)

Semikernels modulo F and kernels in digraphs. - Hortensia Galeana-Sánchez (Discret. Math., 2000)

Kernels in the closure of coloured digraphs. - Hortensia Galeana-Sánchez; José de Jesús García-Ruvalcaba (Discuss. Math. Graph Theory, 2000)

A class of tight circulant tournaments. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 2000)

On graphs all of whose {C3, T3}-free arc colorations are kernel-perfect. - Hortensia Galeana-Sánchez; José de Jesús García-Ruvalcaba (Discuss. Math. Graph Theory, 2001)

Kernels in digraphs with covering number at most 3. - Hortensia Galeana-Sánchez (Discret. Math., 2002)

Algunos resultados en la teoria de nucleos en diagraficas - Hortensia Galeana-Sánchez (2002)

A counterexample to a conjecture on edge-coloured tournaments. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Discret. Math., 2004)

On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Discret. Math., 2004)

Kernels in pretransitive digraphs. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Discret. Math., 2004)

Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel. - Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 2004)

Cycle-pancyclism in bipartite tournaments I. - Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 2004)

Cycle-pancyclism in bipartite tournaments II. - Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 2004)

On the heterochromatic number of circulant digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 2004)

Kernels in monochromatic path digraphs. - Hortensia Galeana-Sánchez; Laura Pastrana Ramírez; Hugo Alberto Rincón-Mejía (Discuss. Math. Graph Theory, 2005)

New sufficient conditions for the existence of kernels in digraphs. - Mucuy-kak Guevara; Hortensia Galeana-Sánchez (Electron. Notes Discret. Math., 2005)

Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Graphs Comb., 2005)

Kernels and perfectness in arc-local tournament digraphs. - Hortensia Galeana-Sánchez (Discret. Math., 2006)

Kernels in quasi-transitive digraphs. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Discret. Math., 2006)

(k, l)-kernels, (k, l)-semikernels, k-Grundy functions and duality for state splittings. - Hortensia Galeana-Sánchez; Ricardo Gómez (Discuss. Math. Graph Theory, 2007)

Monochromatic kernel-perfectness of special classes of digraphs. - Hortensia Galeana-Sánchez; Luis Alberto Jiménez Ramírez (Discuss. Math. Graph Theory, 2007)

Kernel perfect and critical kernel imperfect digraphs structure. - Hortensia Galeana-Sánchez; Mucuy-kak Guevara (Electron. Notes Discret. Math., 2007)

Absorbent sets and kernels by monochromatic directed paths in m-colored tournaments. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Australas. J Comb., 2008)

Kernels in edge-coloured orientations of nearly complete graphs. - Hortensia Galeana-Sánchez (Discret. Math., 2008)

Independent sets and non-augmentable paths in generalizations of tournaments. - Hortensia Galeana-Sánchez; Ricardo Gómez (Discret. Math., 2008)

Kernels and some operations in edge-coloured digraphs. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Discret. Math., 2008)

Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Discuss. Math. Graph Theory, 2008)

Alternating Domination In Arc-Colored Digraphs. - Pietra Delgado-Escalante; Hortensia Galeana-Sánchez (Ars Comb., 2009)

Some sufficient conditions for the existence of kernels in infinite digraphs. - Hortensia Galeana-Sánchez; Mucuy-kak Guevara (Discret. Math., 2009)

Kernels and cycles' subdivisions in arc-colored tournaments. - Pietra Delgado-Escalante; Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 2009)

Independent transversals of longest paths in locally semicomplete and transitive digraphs. - Hortensia Galeana-Sánchez; Ricardo Gómez; Juan José Montellano-Ballesteros (Discuss. Math. Graph Theory, 2009)

Directed hypergraphs: A tool for researching digraphs and hypergraphs. - Hortensia Galeana-Sánchez; Martín Manrique (Discuss. Math. Graph Theory, 2009)

k-Kernels and some operations in digraphs. - Hortensia Galeana-Sánchez; Laura Pastrana (Discuss. Math. Graph Theory, 2009)

Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; B. Zavala (Discuss. Math. Graph Theory, 2009)

Monochromatic paths and monochromatic sets of arcs in bipartite tournaments. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; B. Zavala (Discuss. Math. Graph Theory, 2009)

A classification of arc-locally semicomplete digraphs. - Hortensia Galeana-Sánchez; Ilan A. Goldfeder (Electron. Notes Discret. Math., 2009)

Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Discret. Appl. Math., 2010)

On the structure of strong 3-quasi-transitive digraphs. - Hortensia Galeana-Sánchez; Ilan A. Goldfeder; Isabel Urrutia (Discret. Math., 2010)

Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; B. Zavala (Discuss. Math. Graph Theory, 2010)

H-kernels in the D-join. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (Ars Comb., 2011)

Kernels by monochromatic paths in digraphs with covering number 2. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Math., 2011)

On monochromatic paths and bicolored subdigraphs in arc-colored tournaments. - Pietra Delgado-Escalante; Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 2011)

Kernels by monochromatic paths and the color-class digraph. - Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 2011)

Monochromatic cycles and monochromatic paths in arc-colored digraphs. - Hortensia Galeana-Sánchez; G. Gaytán-Gómez; Rocío Rojas-Monroy (Discuss. Math. Graph Theory, 2011)

Cyclically k-partite digraphs and k-kernels. - Hortensia Galeana-Sánchez; César Hernández-Cruz (Discuss. Math. Graph Theory, 2011)

k-kernels in generalizations of transitive digraphs. - Hortensia Galeana-Sánchez; César Hernández-Cruz (Discuss. Math. Graph Theory, 2011)

Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Ars Comb., 2012)

Tournaments with kernels by monochromatic paths. - Hortensia Galeana-Sánchez; Eugenia O'Reilly Regueiro (Contributions Discret. Math., 2012)

On the existence and number of (k+1)-kings in k-quasi-transitive digraphs - César Hernández-Cruz; Hortensia Galeana-Sánchez; Manuel Alejandro Juárez-Camacho (CoRR, 2012)

k-colored kernels. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Discret. Appl. Math., 2012)

A new characterization of perfect graphs. - Hortensia Galeana-Sánchez (Discret. Math., 2012)

A classification of all arc-locally semicomplete digraphs. - Hortensia Galeana-Sánchez; Ilan A. Goldfeder (Discret. Math., 2012)

k-kernels in k-transitive and k-quasi-transitive digraphs. - César Hernández-Cruz; Hortensia Galeana-Sánchez (Discret. Math., 2012)

The Path Partition Conjecture is true for some generalizations of tournaments. - Alan Arroyo; Hortensia Galeana-Sánchez (Discret. Math., 2013)

On the existence and number of (k+1)(k+1)-kings in kk-quasi-transitive digraphs. - Hortensia Galeana-Sánchez; César Hernández-Cruz; Manuel Alejandro Juárez-Camacho (Discret. Math., 2013)

Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Math., 2013)

γ-cycles and transivity by monochromatic paths in arc-coloured digraphs. - Enrique Casas-Bautista; Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (Discuss. Math. Graph Theory, 2013)

H-Kernels in Infinite Digraphs. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (Graphs Comb., 2013)

Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor. - Hortensia Galeana-Sánchez; Ilan A. Goldfeder (Discret. Math., 2014)

On the existence of (k, l)-kernels in infinite digraphs: A survey. - Hortensia Galeana-Sánchez; César Hernández-Cruz (Discuss. Math. Graph Theory, 2014)

Cycles and transitivity by monochromatic paths in arc-coloured digraphs. - Enrique Casas-Bautista; Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (AKCE Int. J. Graphs Comb., 2015)

Independent and monochromatic absorbent sets in infinite digraphs. - Alejandro Contreras-Balbuena; Hortensia Galeana-Sánchez; Rocío Rojas-Monroy (AKCE Int. J. Graphs Comb., 2015)

The Fibonacci numbers of certain subgraphs of circulant graphs. - Loiret Alejandría Dosal-Trujillo; Hortensia Galeana-Sánchez (AKCE Int. J. Graphs Comb., 2015)

New classes of panchromatic digraphs. - Hortensia Galeana-Sánchez; Micael Toledo (AKCE Int. J. Graphs Comb., 2015)

H-kernels and H-obstructions in H-colored digraphs. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (Discret. Math., 2015)

H-Paths and H-Cycles in H-Coloured Digraphs. - Hortensia Galeana-Sánchez; Ingrid Torres-Ramos (Graphs Comb., 2015)

An Extension of Richardson's Theorem in m-Colored Digraphs. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (Graphs Comb., 2015)

Π-Kernels in Digraphs. - Hortensia Galeana-Sánchez; Juan José Montellano-Ballesteros (Graphs Comb., 2015)

On Panchromatic Digraphs and the Panchromatic Number. - Hortensia Galeana-Sánchez; Ricardo Strausz (Graphs Comb., 2015)

H-kernels by walks in H-colored digraphs and the color-class digraph. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (AKCE Int. J. Graphs Comb., 2016)

Richardson's Theorem for k-colored kernels in strongly connected digraphs. - Hortensia Galeana-Sánchez; Juan José Montellano-Ballesteros (Discret. Appl. Math., 2016)

Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs. - Hortensia Galeana-Sánchez; Mucuy-kak Guevara (Discret. Appl. Math., 2016)

Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs. - Narda Cordero-Michel; Hortensia Galeana-Sánchez; Ilan A. Goldfeder (Discret. Math., 2016)

On panchromatic patterns. - Hortensia Galeana-Sánchez; Ricardo Strausz (Discret. Math., 2016)

?-cycles in arc-colored digraphs. - Hortensia Galeana-Sánchez; G. Gaytán-Gómez; Rocío Rojas-Monroy (Discuss. Math. Graph Theory, 2016)

Kernels by monochromatic paths and color-perfect digraphs. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (Discuss. Math. Graph Theory, 2016)

Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs. - Mucuy-kak Guevara; Camino Balbuena; Hortensia Galeana-Sánchez (Electron. Notes Discret. Math., 2016)

CKI-Digraphs, Generalized Sums and Partitions of Digraphs. - Hortensia Galeana-Sánchez; Mika Olsen (Graphs Comb., 2016)

Richardson's Theorem in H-coloured Digraphs. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (Graphs Comb., 2016)

A Characterization of Locally Semicomplete CKI-digraphs. - Hortensia Galeana-Sánchez; Mika Olsen (Graphs Comb., 2016)

A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs. - Alejandro Contreras-Balbuena; Hortensia Galeana-Sánchez; Ilan A. Goldfeder (Discret. Appl. Math., 2017)

Infinite quasi-transitive digraphs with domination number 2. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Appl. Math., 2017)

A Richardson's theorem version for ⊓-kernels. - Hortensia Galeana-Sánchez; Juan José Montellano-Ballesteros (Discret. Math., 2017)

Quasi-Transitive Digraphs and Their Extensions. - Hortensia Galeana-Sánchez; César Hernández-Cruz (Classes of Directed Graphs, 2018)

Alternating kernels. - Pietra Delgado-Escalante; Hortensia Galeana-Sánchez; Eugenia O'Reilly Regueiro (Discret. Appl. Math., 2018)

Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Math. Theor. Comput. Sci., 2018)

(A, ℬ)-kernels and Sands, Sauer and Woodrow's theorem. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; Rocío Sánchez-López (AKCE Int. J. Graphs Comb., 2019)

H-kernels by walks in an RH(D) digraph. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; Rocío Sánchez-López; Berta Zavala-Santana (AKCE Int. J. Graphs Comb., 2019)

Characterization of color patterns by dynamic H-paths. - Germán Benítez-Bobadilla; Hortensia Galeana-Sánchez; César Hernández-Cruz (Discret. Appl. Math., 2019)

On the Fibonacci numbers of the composition of graphs. - Loiret Alejandría Dosal-Trujillo; Hortensia Galeana-Sánchez (Discret. Appl. Math., 2019)

Unions of digraphs which become kernel perfect. - Hortensia Galeana-Sánchez; Mucuy-kak Guevara (Discret. Appl. Math., 2019)

About (k, l)-kernels, semikernels and Grundy functions in partial line digraphs. - Camino Balbuena; Hortensia Galeana-Sánchez; Mucuy-kak Guevara (Discuss. Math. Graph Theory, 2019)

Alternating Hamiltonian cycles in 2-edge-colored multigraphs. - Alejandro Contreras-Balbuena; Hortensia Galeana-Sánchez; Ilan A. Goldfeder (Discret. Math. Theor. Comput. Sci., 2019)

New Bounds for the Dichromatic Number of a Digraph. - Narda Cordero-Michel; Hortensia Galeana-Sánchez (Discret. Math. Theor. Comput. Sci., 2019)

Some Conditions for the Existence of Euler H-trails. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; Rocío Sánchez-López; Juana Imelda Villarreal-Valdés (Graphs Comb., 2019)

A dichotomy for the kernel by H-walks problem in digraphs. - Hortensia Galeana-Sánchez; César Hernández-Cruz (J. Graph Theory, 2019)

Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs. - Pilar Cano; Hortensia Galeana-Sánchez; Ilan A. Goldfeder (AKCE Int. J. Graphs Comb., 2020)

-panchromatic digraphs. - Hortensia Galeana-Sánchez; Miguel Tecpa-Galván (AKCE Int. J. Graphs Comb., 2020)

Extensions of Richardson's theorem for infinite digraphs and (𝒜, ℬ)-kernels. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; Rocío Sánchez-López (AKCE Int. J. Graphs Comb., 2020)

Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs. - Narda Cordero-Michel; Hortensia Galeana-Sánchez (Discret. Appl. Math., 2020)

Richardson's theorem in quasi-transitive and pre-transitive digraphs. - Hortensia Galeana-Sánchez; Rocío Sánchez-López (Graphs Comb., 2020)

H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. - Hortensia Galeana-Sánchez; Eugenia O'Reilly Regueiro (Contributions Discret. Math., 2021)

Vertex-pancyclism in the generalized sum of digraphs. - Narda Cordero-Michel; Hortensia Galeana-Sánchez (Discret. Appl. Math., 2021)

Alternating-pancyclism in 2-edge-colored graphs. - Narda Cordero-Michel; Hortensia Galeana-Sánchez (Discuss. Math. Graph Theory, 2021)

H-Cycles in H-Colored Multigraphs. - Hortensia Galeana-Sánchez; Rocío Rojas-Monroy; Rocío Sánchez-López; Juana Imelda Villarreal-Valdés (Graphs Comb., 2022)

H-Kernels by Walks. - Hortensia Galeana-Sánchez; Hugo Rincon Galeana; Ricardo Strausz (Graphs Comb., 2022)

Cycles and new bounds for the chromatic number. - Narda Cordero-Michel; Hortensia Galeana-Sánchez; Ilan A. Goldfeder (Discret. Math., 2023)

A generalization of properly colored paths and cycles in edge-colored graphs. - Hortensia Galeana-Sánchez; Felipe Hernández-Lorenzana; Rocío Sánchez-López (Theor. Comput. Sci., 2023)

Euler dynamic H -trails in edge-colored graphs. - Carlos Vilchis-Alfaro; Hortensia Galeana-Sánchez (AKCE Int. J. Graphs Comb., 2024)

A quick way to verify if a graph is 3-colorable. - Narda Cordero-Michel; Hortensia Galeana-Sánchez (Discret. Appl. Math., 2024)

Panchromatic patterns by paths. - Germán Benítez-Bobadilla; Hortensia Galeana-Sánchez; César Hernández-Cruz (Discuss. Math. Graph Theory, 2024)

$(k,H)$-kernels in nearly tournaments. - Hortensia Galeana-Sánchez; Miguel Tecpa-Galván (Discuss. Math. Graph Theory, 2024)

Congruence of cycle lengths and chromatic number. - Narda Cordero-Michel; Hortensia Galeana-Sánchez (J. Graph Theory, 2024)

Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter. - Germán Benítez-Bobadilla; Hortensia Galeana-Sánchez; César Hernández-Cruz (Discret. Appl. Math., 2025)

Dynamic Cycles in Edge-Colored Multigraphs. - Hortensia Galeana-Sánchez; Carlos Vilchis-Alfaro (Graphs Comb., 2025)