default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHortensia Galeana-Sánchez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j138]Carlos Vilchis-Alfaro, Hortensia Galeana-Sánchez:
Euler dynamic H -trails in edge-colored graphs. AKCE Int. J. Graphs Comb. 21(1): 48-56 (2024)- [j137]Narda Cordero-Michel
, Hortensia Galeana-Sánchez:
A quick way to verify if a graph is 3-colorable. Discret. Appl. Math. 359: 176-185 (2024) - [j136]Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz:
Panchromatic patterns by paths. Discuss. Math. Graph Theory 44(2): 519 (2024) - [j135]Hortensia Galeana-Sánchez, Miguel Tecpa-Galván:
$(k,H)$-kernels in nearly tournaments. Discuss. Math. Graph Theory 44(2): 639 (2024) - [j134]Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Congruence of cycle lengths and chromatic number. J. Graph Theory 105(2): 239-251 (2024) - 2023
- [j133]Narda Cordero-Michel, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Cycles and new bounds for the chromatic number. Discret. Math. 346(3): 113255 (2023) - [j132]Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana, Rocío Sánchez-López:
A generalization of properly colored paths and cycles in edge-colored graphs. Theor. Comput. Sci. 946: 113679 (2023) - 2022
- [j131]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López, Juana Imelda Villarreal-Valdés:
H-Cycles in H-Colored Multigraphs. Graphs Comb. 38(3): 62 (2022) - [j130]Hortensia Galeana-Sánchez, Hugo Rincon Galeana, Ricardo Strausz:
H-Kernels by Walks. Graphs Comb. 38(3): 94 (2022) - 2021
- [j129]Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro:
H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. Contributions Discret. Math. 16(1): 150-159 (2021) - [j128]Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Vertex-pancyclism in the generalized sum of digraphs. Discret. Appl. Math. 295: 94-101 (2021) - [j127]Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Alternating-pancyclism in 2-edge-colored graphs. Discuss. Math. Graph Theory 41(3): 779-800 (2021) - 2020
- [j126]Hortensia Galeana-Sánchez, Miguel Tecpa-Galván:
-panchromatic digraphs. AKCE Int. J. Graphs Comb. 17(1): 303-313 (2020) - [j125]Pilar Cano, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Some results on the existence of Hamiltonian cycles in -compositions of bipartite digraphs. AKCE Int. J. Graphs Comb. 17(3): 713-719 (2020) - [j124]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López:
Extensions of Richardson's theorem for infinite digraphs and (𝒜, ℬ)-kernels. AKCE Int. J. Graphs Comb. 17(3): 1014-1020 (2020) - [j123]Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs. Discret. Appl. Math. 284: 281-289 (2020) - [j122]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
Richardson's theorem in quasi-transitive and pre-transitive digraphs. Graphs Comb. 36(4): 1247-1261 (2020)
2010 – 2019
- 2019
- [j121]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López:
(A, ℬ)-kernels and Sands, Sauer and Woodrow's theorem. AKCE Int. J. Graphs Comb. 16(3): 284-290 (2019) - [j120]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López, Berta Zavala-Santana:
H-kernels by walks in an RH(D) digraph. AKCE Int. J. Graphs Comb. 16(3): 291-299 (2019) - [j119]Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
Unions of digraphs which become kernel perfect. Discret. Appl. Math. 263: 160-165 (2019) - [j118]Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez:
On the Fibonacci numbers of the composition of graphs. Discret. Appl. Math. 266: 213-218 (2019) - [j117]Germán Benítez-Bobadilla, Hortensia Galeana-Sánchez, César Hernández-Cruz:
Characterization of color patterns by dynamic H-paths. Discret. Appl. Math. 267: 41-51 (2019) - [j116]Camino Balbuena, Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
About (k, l)-kernels, semikernels and Grundy functions in partial line digraphs. Discuss. Math. Graph Theory 39(4): 855-866 (2019) - [j115]Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Alternating Hamiltonian cycles in 2-edge-colored multigraphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j114]Narda Cordero-Michel, Hortensia Galeana-Sánchez:
New Bounds for the Dichromatic Number of a Digraph. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j113]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, Rocío Sánchez-López, Juana Imelda Villarreal-Valdés:
Some Conditions for the Existence of Euler H-trails. Graphs Comb. 35(5): 1197-1208 (2019) - [j112]Hortensia Galeana-Sánchez, César Hernández-Cruz:
A dichotomy for the kernel by H-walks problem in digraphs. J. Graph Theory 90(3): 213-226 (2019) - 2018
- [j111]Pietra Delgado-Escalante, Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro:
Alternating kernels. Discret. Appl. Math. 236: 153-164 (2018) - [j110]Hortensia Galeana-Sánchez, Mika Olsen:
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [p1]Hortensia Galeana-Sánchez, César Hernández-Cruz:
Quasi-Transitive Digraphs and Their Extensions. Classes of Directed Graphs 2018: 341-404 - [i3]Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Alternating Hamiltonian cycles in 2-edge-colored multigraphs. CoRR abs/1810.04372 (2018) - [i2]Narda Cordero-Michel, Hortensia Galeana-Sánchez:
New Bounds for the Dichromatic Number of a Digraph. CoRR abs/1810.09427 (2018) - 2017
- [j109]Hortensia Galeana-Sánchez, Mika Olsen:
Infinite quasi-transitive digraphs with domination number 2. Discret. Appl. Math. 226: 44-50 (2017) - [j108]Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs. Discret. Appl. Math. 229: 55-63 (2017) - [j107]Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
A Richardson's theorem version for ⊓-kernels. Discret. Math. 340(5): 984-987 (2017) - 2016
- [j106]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-kernels by walks in H-colored digraphs and the color-class digraph. AKCE Int. J. Graphs Comb. 13(2): 120-129 (2016) - [j105]Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Richardson's Theorem for k-colored kernels in strongly connected digraphs. Discret. Appl. Math. 203: 47-52 (2016) - [j104]Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs. Discret. Appl. Math. 210: 235-245 (2016) - [j103]Narda Cordero-Michel, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs. Discret. Math. 339(6): 1763-1770 (2016) - [j102]Hortensia Galeana-Sánchez, Ricardo Strausz:
On panchromatic patterns. Discret. Math. 339(10): 2536-2542 (2016) - [j101]Hortensia Galeana-Sánchez, G. Gaytán-Gómez, Rocío Rojas-Monroy:
?-cycles in arc-colored digraphs. Discuss. Math. Graph Theory 36(1): 103-115 (2016) - [j100]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
Kernels by monochromatic paths and color-perfect digraphs. Discuss. Math. Graph Theory 36(2): 309-321 (2016) - [j99]Mucuy-kak Guevara, Camino Balbuena, Hortensia Galeana-Sánchez:
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs. Electron. Notes Discret. Math. 54: 265-269 (2016) - [j98]Hortensia Galeana-Sánchez, Mika Olsen:
CKI-Digraphs, Generalized Sums and Partitions of Digraphs. Graphs Comb. 32(1): 123-131 (2016) - [j97]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
Richardson's Theorem in H-coloured Digraphs. Graphs Comb. 32(2): 629-638 (2016) - [j96]Hortensia Galeana-Sánchez, Mika Olsen:
A Characterization of Locally Semicomplete CKI-digraphs. Graphs Comb. 32(5): 1873-1879 (2016) - 2015
- [j95]Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez:
The Fibonacci numbers of certain subgraphs of circulant graphs. AKCE Int. J. Graphs Comb. 12(Issues): 94-103 (2015) - [j94]Enrique Casas-Bautista, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Cycles and transitivity by monochromatic paths in arc-coloured digraphs. AKCE Int. J. Graphs Comb. 12(Issues): 104-112 (2015) - [j93]Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Independent and monochromatic absorbent sets in infinite digraphs. AKCE Int. J. Graphs Comb. 12(Issues): 119-123 (2015) - [j92]Hortensia Galeana-Sánchez, Micael Toledo:
New classes of panchromatic digraphs. AKCE Int. J. Graphs Comb. 12(Issues): 124-132 (2015) - [j91]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-kernels and H-obstructions in H-colored digraphs. Discret. Math. 338(12): 2288-2294 (2015) - [j90]Hortensia Galeana-Sánchez, Ricardo Strausz:
On Panchromatic Digraphs and the Panchromatic Number. Graphs Comb. 31(1): 115-125 (2015) - [j89]Hortensia Galeana-Sánchez, Ingrid Torres-Ramos:
H-Paths and H-Cycles in H-Coloured Digraphs. Graphs Comb. 31(3): 615-628 (2015) - [j88]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
An Extension of Richardson's Theorem in m-Colored Digraphs. Graphs Comb. 31(4): 1029-1041 (2015) - [j87]Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Π-Kernels in Digraphs. Graphs Comb. 31(6): 2207-2214 (2015) - 2014
- [j86]Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor. Discret. Math. 315-316: 135-143 (2014) - [j85]Hortensia Galeana-Sánchez, César Hernández-Cruz:
On the existence of (k, l)-kernels in infinite digraphs: A survey. Discuss. Math. Graph Theory 34(3): 431-466 (2014) - 2013
- [j84]Alan Arroyo, Hortensia Galeana-Sánchez:
The Path Partition Conjecture is true for some generalizations of tournaments. Discret. Math. 313(3): 293-300 (2013) - [j83]Hortensia Galeana-Sánchez, Mika Olsen:
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3. Discret. Math. 313(13): 1464-1474 (2013) - [j82]Hortensia Galeana-Sánchez, César Hernández-Cruz, Manuel Alejandro Juárez-Camacho:
On the existence and number of (k+1)(k+1)-kings in kk-quasi-transitive digraphs. Discret. Math. 313(22): 2582-2591 (2013) - [j81]Enrique Casas-Bautista, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
γ-cycles and transivity by monochromatic paths in arc-coloured digraphs. Discuss. Math. Graph Theory 33(3): 493-507 (2013) - [j80]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-Kernels in Infinite Digraphs. Graphs Comb. 29(4): 913-920 (2013) - 2012
- [j79]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes. Ars Comb. 106: 461-471 (2012) - [j78]Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro:
Tournaments with kernels by monochromatic paths. Contributions Discret. Math. 7(2) (2012) - [j77]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
k-colored kernels. Discret. Appl. Math. 160(13-14): 1971-1978 (2012) - [j76]Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
A classification of all arc-locally semicomplete digraphs. Discret. Math. 312(11): 1883-1891 (2012) - [j75]César Hernández-Cruz, Hortensia Galeana-Sánchez:
k-kernels in k-transitive and k-quasi-transitive digraphs. Discret. Math. 312(16): 2522-2530 (2012) - [j74]Hortensia Galeana-Sánchez:
A new characterization of perfect graphs. Discret. Math. 312(17): 2751-2755 (2012) - [i1]César Hernández-Cruz, Hortensia Galeana-Sánchez, Manuel Alejandro Juárez-Camacho:
On the existence and number of (k+1)-kings in k-quasi-transitive digraphs. CoRR abs/1206.1897 (2012) - 2011
- [j73]Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-kernels in the D-join. Ars Comb. 98: 353-377 (2011) - [j72]Hortensia Galeana-Sánchez, Mika Olsen:
Kernels by monochromatic paths in digraphs with covering number 2. Discret. Math. 311(13): 1111-1118 (2011) - [j71]Hortensia Galeana-Sánchez, César Hernández-Cruz:
Cyclically k-partite digraphs and k-kernels. Discuss. Math. Graph Theory 31(1): 63-78 (2011) - [j70]Hortensia Galeana-Sánchez:
Kernels by monochromatic paths and the color-class digraph. Discuss. Math. Graph Theory 31(2): 273-281 (2011) - [j69]Hortensia Galeana-Sánchez, G. Gaytán-Gómez, Rocío Rojas-Monroy:
Monochromatic cycles and monochromatic paths in arc-colored digraphs. Discuss. Math. Graph Theory 31(2): 283-292 (2011) - [j68]Hortensia Galeana-Sánchez, César Hernández-Cruz:
k-kernels in generalizations of transitive digraphs. Discuss. Math. Graph Theory 31(2): 293-312 (2011) - [j67]Pietra Delgado-Escalante, Hortensia Galeana-Sánchez:
On monochromatic paths and bicolored subdigraphs in arc-colored tournaments. Discuss. Math. Graph Theory 31(4): 791-820 (2011) - 2010
- [j66]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs. Discret. Appl. Math. 158(5): 461-466 (2010) - [j65]Hortensia Galeana-Sánchez, Ilan A. Goldfeder, Isabel Urrutia:
On the structure of strong 3-quasi-transitive digraphs. Discret. Math. 310(19): 2495-2498 (2010) - [j64]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs. Discuss. Math. Graph Theory 30(4): 545-553 (2010)
2000 – 2009
- 2009
- [j63]Pietra Delgado-Escalante, Hortensia Galeana-Sánchez:
Alternating Domination In Arc-Colored Digraphs. Ars Comb. 90 (2009) - [j62]Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
Some sufficient conditions for the existence of kernels in infinite digraphs. Discret. Math. 309(11): 3680-3693 (2009) - [j61]Hortensia Galeana-Sánchez, Laura Pastrana:
k-Kernels and some operations in digraphs. Discuss. Math. Graph Theory 29(1): 39-49 (2009) - [j60]Pietra Delgado-Escalante, Hortensia Galeana-Sánchez:
Kernels and cycles' subdivisions in arc-colored tournaments. Discuss. Math. Graph Theory 29(1): 101-117 (2009) - [j59]Hortensia Galeana-Sánchez, Martín Manrique:
Directed hypergraphs: A tool for researching digraphs and hypergraphs. Discuss. Math. Graph Theory 29(2): 313-335 (2009) - [j58]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs. Discuss. Math. Graph Theory 29(2): 337-347 (2009) - [j57]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala:
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments. Discuss. Math. Graph Theory 29(2): 349-360 (2009) - [j56]Hortensia Galeana-Sánchez, Ricardo Gómez, Juan José Montellano-Ballesteros:
Independent transversals of longest paths in locally semicomplete and transitive digraphs. Discuss. Math. Graph Theory 29(3): 469-480 (2009) - [j55]Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
A classification of arc-locally semicomplete digraphs. Electron. Notes Discret. Math. 34: 59-61 (2009) - 2008
- [j54]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
Absorbent sets and kernels by monochromatic directed paths in m-colored tournaments. Australas. J Comb. 40: 197-210 (2008) - [j53]Hortensia Galeana-Sánchez, Ricardo Gómez:
Independent sets and non-augmentable paths in generalizations of tournaments. Discret. Math. 308(12): 2460-2472 (2008) - [j52]Hortensia Galeana-Sánchez:
Kernels in edge-coloured orientations of nearly complete graphs. Discret. Math. 308(20): 4599-4607 (2008) - [j51]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Kernels and some operations in edge-coloured digraphs. Discret. Math. 308(24): 6036-6046 (2008) - [j50]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments. Discuss. Math. Graph Theory 28(2): 285-306 (2008) - 2007
- [j49]Hortensia Galeana-Sánchez, Ricardo Gómez:
(k, l)-kernels, (k, l)-semikernels, k-Grundy functions and duality for state splittings. Discuss. Math. Graph Theory 27(2): 359-371 (2007) - [j48]Hortensia Galeana-Sánchez, Luis Alberto Jiménez Ramírez:
Monochromatic kernel-perfectness of special classes of digraphs. Discuss. Math. Graph Theory 27(3): 389-400 (2007) - [j47]Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
Kernel perfect and critical kernel imperfect digraphs structure. Electron. Notes Discret. Math. 28: 401-408 (2007) - 2006
- [j46]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Kernels in quasi-transitive digraphs. Discret. Math. 306(16): 1969-1974 (2006) - [j45]Hortensia Galeana-Sánchez:
Kernels and perfectness in arc-local tournament digraphs. Discret. Math. 306(19-20): 2473-2480 (2006) - 2005
- [j44]Hortensia Galeana-Sánchez, Laura Pastrana Ramírez, Hugo Alberto Rincón-Mejía:
Kernels in monochromatic path digraphs. Discuss. Math. Graph Theory 25(3): 407-417 (2005) - [j43]Mucuy-kak Guevara, Hortensia Galeana-Sánchez:
New sufficient conditions for the existence of kernels in digraphs. Electron. Notes Discret. Math. 22: 287-290 (2005) - [j42]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments. Graphs Comb. 21(3): 307-317 (2005) - 2004
- [j41]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
Kernels in pretransitive digraphs. Discret. Math. 275(1-3): 129-136 (2004) - [j40]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
A counterexample to a conjecture on edge-coloured tournaments. Discret. Math. 282(1-3): 275-276 (2004) - [j39]Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments. Discret. Math. 285(1-3): 313-318 (2004) - [j38]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On the heterochromatic number of circulant digraphs. Discuss. Math. Graph Theory 24(1): 73-79 (2004) - [j37]Hortensia Galeana-Sánchez:
Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel. Discuss. Math. Graph Theory 24(2): 171-182 (2004) - [j36]Hortensia Galeana-Sánchez:
Cycle-pancyclism in bipartite tournaments I. Discuss. Math. Graph Theory 24(2): 277-290 (2004) - [j35]Hortensia Galeana-Sánchez:
Cycle-pancyclism in bipartite tournaments II. Discuss. Math. Graph Theory 24(3): 529-538 (2004) - 2002
- [b1]Hortensia Galeana-Sánchez:
Algunos resultados en la teoria de nucleos en diagraficas. UNAM, Mexico, 2002 - [j34]Hortensia Galeana-Sánchez:
Kernels in digraphs with covering number at most 3. Discret. Math. 259(1-3): 121-135 (2002) - 2001
- [j33]Hortensia Galeana-Sánchez, José de Jesús García-Ruvalcaba:
On graphs all of whose {C3, T3}-free arc colorations are kernel-perfect. Discuss. Math. Graph Theory 21(1): 77-93 (2001) - 2000
- [j32]Hortensia Galeana-Sánchez:
Semikernels modulo F and kernels in digraphs. Discret. Math. 218(1-3): 61-71 (2000) - [j31]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
A class of tight circulant tournaments. Discuss. Math. Graph Theory 20(1): 109-128 (2000) - [j30]Hortensia Galeana-Sánchez, José de Jesús García-Ruvalcaba:
Kernels in the closure of coloured digraphs. Discuss. Math. Graph Theory 20(2): 243-254 (2000)
1990 – 1999
- 1998
- [j29]Hortensia Galeana-Sánchez, Xueliang Li:
Kernels in a special class of digraphs. Discret. Math. 178(1-3): 73-80 (1998) - [j28]Hortensia Galeana-Sánchez:
Kernels in edge-colored digraphs. Discret. Math. 184(1-3): 87-99 (1998) - [j27]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
New classes of critical kernel-imperfect digraphs. Discuss. Math. Graph Theory 18(1): 85-89 (1998) - [j26]Hortensia Galeana-Sánchez, Laura Pastrana Ramírez:
Kernels in edge coloured line digraph. Discuss. Math. Graph Theory 18(1): 91-98 (1998) - [j25]Hortensia Galeana-Sánchez:
On independent sets and non-augmentable paths in directed graphs. Discuss. Math. Graph Theory 18(2): 171-181 (1998) - [j24]Hortensia Galeana-Sánchez, Hugo Alberto Rincón-Mejía:
A sufficient condition for the existence of k-kernels in digraphs. Discuss. Math. Graph Theory 18(2): 197-204 (1998) - [j23]Hortensia Galeana-Sánchez, Sergio Rajsbaum:
A conjecture on cycle-pancyclism in tournaments. Discuss. Math. Graph Theory 18(2): 243-251 (1998) - [j22]Hortensia Galeana-Sánchez, Xueliang Li:
Semikernels and (k, l)-Kernels in Digraphs. SIAM J. Discret. Math. 11(2): 340-346 (1998) - 1997
- [j21]Hortensia Galeana-Sánchez:
A characterization of normal fraternally orientable perfect graphs. Discret. Math. 169(1-3): 221-225 (1997) - [j20]Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments III. Graphs Comb. 13(1): 57-63 (1997) - 1996
- [j19]Hortensia Galeana-Sánchez, Hugo Alberto Rincón-Mejía:
Independent sets which meet all longest paths. Discret. Math. 152(1-3): 141-145 (1996) - [j18]Hortensia Galeana-Sánchez:
On monochromatic paths and monochromatic cycles in edge coloured tournaments. Discret. Math. 156(1-3): 103-112 (1996) - [j17]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition. Discuss. Math. Graph Theory 16(1): 5-16 (1996) - [j16]Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments II. Graphs Comb. 12(1): 9-16 (1996) - [j15]Hortensia Galeana-Sánchez:
On claw-free M-oriented critical kernel-imperfect digraphs. J. Graph Theory 21(1): 33-39 (1996) - 1995
- [j14]Hortensia Galeana-Sánchez:
B1- and B2-orientable graphs in kernel theory. Discret. Math. 143(1-3): 269-274 (1995) - [j13]Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments I. Graphs Comb. 11(3): 233-243 (1995) - 1994
- [j12]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. Graphs Comb. 10(2-4): 329-336 (1994) - 1993
- [j11]Hortensia Galeana-Sánchez:
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture. Discret. Math. 122(1-3): 167-177 (1993) - 1992
- [j10]Hortensia Galeana-Sánchez:
On the existence of kernels and h-kernels in directed graphs. Discret. Math. 110(1-3): 251-255 (1992) - 1991
- [j9]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
Orientations of graphs in kernel theory. Discret. Math. 87(3): 271-280 (1991) - [j8]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
Extending kernel perfect digraphs to kernel perfect critical digraphs. Discret. Math. 94(3): 181-187 (1991) - [j7]Hortensia Galeana-Sánchez, Laura Pastrana Ramírez, Hugo Alberto Rincón-Mejía:
Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph. SIAM J. Discret. Math. 4(1): 80-83 (1991) - 1990
- [j6]Hortensia Galeana-Sánchez:
On the existence of (k, l)-kernels in digraphs. Discret. Math. 85(1): 99-102 (1990)
1980 – 1989
- 1988
- [j5]Hortensia Galeana-Sánchez:
A new method to extend kernel-perfect graphs to kernel-perfect critical graphs. Discret. Math. 69(2): 207-209 (1988) - 1986
- [j4]Hortensia Galeana-Sánchez:
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs. Discret. Math. 59(1-2): 35-41 (1986) - [j3]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On kernel-perfect critical digraphs. Discret. Math. 59(3): 257-265 (1986) - 1984
- [j2]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On kernels and semikernels of digraphs. Discret. Math. 48(1): 67-76 (1984) - 1982
- [j1]Hortensia Galeana-Sánchez:
A counterexample to a conjecture of meyniel on kernel-perfect graphs. Discret. Math. 41(1): 105-107 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 23:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
