Остановите войну!
for scientists:
default search action
Hortensia Galeana-Sánchez
Publications
- 2022
- [j130]Hortensia Galeana-Sánchez, Hugo Rincon Galeana, Ricardo Strausz:
H-Kernels by Walks. Graphs Comb. 38(3): 94 (2022) - 2019
- [j119]Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
Unions of digraphs which become kernel perfect. Discret. Appl. Math. 263: 160-165 (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) - [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
- [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 - 2017
- [j109]Hortensia Galeana-Sánchez, Mika Olsen:
Infinite quasi-transitive digraphs with domination number 2. Discret. Appl. Math. 226: 44-50 (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
- [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) - [j102]Hortensia Galeana-Sánchez, Ricardo Strausz:
On panchromatic patterns. Discret. Math. 339(10): 2536-2542 (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) - [j96]Hortensia Galeana-Sánchez, Mika Olsen:
A Characterization of Locally Semicomplete CKI-digraphs. Graphs Comb. 32(5): 1873-1879 (2016) - 2015
- [j90]Hortensia Galeana-Sánchez, Ricardo Strausz:
On Panchromatic Digraphs and the Panchromatic Number. Graphs Comb. 31(1): 115-125 (2015) - [j87]Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Π-Kernels in Digraphs. Graphs Comb. 31(6): 2207-2214 (2015) - 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
- [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) - 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) - [j77]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
k-colored kernels. Discret. Appl. Math. 160(13-14): 1971-1978 (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) - [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
- [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) - [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) - 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) - 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) - [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) - 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) - 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) - [j47]Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
Kernel perfect and critical kernel imperfect digraphs structure. Electron. Notes Discret. Math. 28: 401-408 (2007) - 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) - 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) - 2000
- [j31]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
A class of tight circulant tournaments. Discuss. Math. Graph Theory 20(1): 109-128 (2000) - 1998
- [j29]Hortensia Galeana-Sánchez, Xueliang Li:
Kernels in a special class of digraphs. Discret. Math. 178(1-3): 73-80 (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) - [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
- [j20]Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments III. Graphs Comb. 13(1): 57-63 (1997) - 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) - 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) - 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) - 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)
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-03-24 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint