 | 2012 |
|---|
| 57 |       | Hortensia Galeana-Sánchez,
Ilan A. Goldfeder:
A classification of all arc-locally semicomplete digraphs.
Discrete Mathematics 312(11): 1883-1891 (2012) |
| 2011 |
|---|
| 56 | | Hortensia Galeana-Sánchez,
Mika Olsen:
Kernels by monochromatic paths in digraphs with covering number 2.
Discrete Mathematics 311(13): 1111-1118 (2011) |
| 55 | | Hortensia Galeana-Sánchez,
César Hernández-Cruz:
Cyclically k-partite digraphs and k-kernels.
Discussiones Mathematicae Graph Theory 31(1): 63-78 (2011) |
| 54 | | Hortensia Galeana-Sánchez:
Kernels by monochromatic paths and the color-class digraph.
Discussiones Mathematicae Graph Theory 31(2): 273-281 (2011) |
| 53 | | Hortensia Galeana-Sánchez,
G. Gaytán-Gómez,
Rocío Rojas-Monroy:
Monochromatic cycles and monochromatic paths in arc-colored digraphs.
Discussiones Mathematicae Graph Theory 31(2): 283-292 (2011) |
| 52 | | Hortensia Galeana-Sánchez,
César Hernández-Cruz:
k-kernels in generalizations of transitive digraphs.
Discussiones Mathematicae Graph Theory 31(2): 293-312 (2011) |
| 51 | | Pietra Delgado-Escalante,
Hortensia Galeana-Sánchez:
On monochromatic paths and bicolored subdigraphs in arc-colored tournaments.
Discussiones Mathematicae Graph Theory 31(4): 791-820 (2011) |
| 2010 |
|---|
| 50 | | Hortensia Galeana-Sánchez,
Bernardo Llano,
Juan José Montellano-Ballesteros:
Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs.
Discrete Applied Mathematics 158(5): 461-466 (2010) |
| 49 | | Hortensia Galeana-Sánchez,
Ilan A. Goldfeder,
Isabel Urrutia:
On the structure of strong 3-quasi-transitive digraphs.
Discrete Mathematics 310(19): 2495-2498 (2010) |
| 48 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy,
B. Zavala:
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs.
Discussiones Mathematicae Graph Theory 30(4): 545-553 (2010) |
| 2009 |
|---|
| 47 | | Hortensia Galeana-Sánchez,
Mucuy-kak Guevara:
Some sufficient conditions for the existence of kernels in infinite digraphs.
Discrete Mathematics 309(11): 3680-3693 (2009) |
| 46 | | Pietra Delgado-Escalante,
Hortensia Galeana-Sánchez:
Kernels and cycles' subdivisions in arc-colored tournaments.
Discussiones Mathematicae Graph Theory 29(1): 101-117 (2009) |
| 45 | | Hortensia Galeana-Sánchez,
Laura Pastrana:
k-Kernels and some operations in digraphs.
Discussiones Mathematicae Graph Theory 29(1): 39-49 (2009) |
| 44 | | Hortensia Galeana-Sánchez,
Martin Manrique:
Directed hypergraphs: A tool for researching digraphs and hypergraphs.
Discussiones Mathematicae Graph Theory 29(2): 313-335 (2009) |
| 43 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy,
B. Zavala:
Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs.
Discussiones Mathematicae Graph Theory 29(2): 337-347 (2009) |
| 42 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy,
B. Zavala:
Monochromatic paths and monochromatic sets of arcs in bipartite tournaments.
Discussiones Mathematicae Graph Theory 29(2): 349-360 (2009) |
| 41 | | Hortensia Galeana-Sánchez,
Ricardo Gómez,
Juan José Montellano-Ballesteros:
Independent transversals of longest paths in locally semicomplete and transitive digraphs.
Discussiones Mathematicae Graph Theory 29(3): 469-480 (2009) |
| 40 | | Hortensia Galeana-Sánchez,
Ilan A. Goldfeder:
A classification of arc-locally semicomplete digraphs.
Electronic Notes in Discrete Mathematics 34: 59-61 (2009) |
| 2008 |
|---|
| 39 | | Hortensia Galeana-Sánchez,
Ricardo Gómez:
Independent sets and non-augmentable paths in generalizations of tournaments.
Discrete Mathematics 308(12): 2460-2472 (2008) |
| 38 | | Hortensia Galeana-Sánchez:
Kernels in edge-coloured orientations of nearly complete graphs.
Discrete Mathematics 308(20): 4599-4607 (2008) |
| 37 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Kernels and some operations in edge-coloured digraphs.
Discrete Mathematics 308(24): 6036-6046 (2008) |
| 36 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments.
Discussiones Mathematicae Graph Theory 28(2): 285-306 (2008) |
| 2007 |
|---|
| 35 | | Hortensia Galeana-Sánchez,
Ricardo Gómez:
(k, l)-kernels, (k, l)-semikernels, k-Grundy functions and duality for state splittings.
Discussiones Mathematicae Graph Theory 27(2): 359-371 (2007) |
| 34 | | Hortensia Galeana-Sánchez,
Luis Alberto Jiménez Ramírez:
Monochromatic kernel-perfectness of special classes of digraphs.
Discussiones Mathematicae Graph Theory 27(3): 389-400 (2007) |
| 33 | | Hortensia Galeana-Sánchez,
Mucuy-kak Guevara:
Kernel perfect and critical kernel imperfect digraphs structure.
Electronic Notes in Discrete Mathematics 28: 401-408 (2007) |
| 2006 |
|---|
| 32 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Kernels in quasi-transitive digraphs.
Discrete Mathematics 306(16): 1969-1974 (2006) |
| 31 | | Hortensia Galeana-Sánchez:
Kernels and perfectness in arc-local tournament digraphs.
Discrete Mathematics 306(19-20): 2473-2480 (2006) |
| 2005 |
|---|
| 30 | | Hortensia Galeana-Sánchez,
Laura Pastrana Ramírez,
Hugo Alberto Rincón-Mejía:
Kernels in monochromatic path digraphs.
Discussiones Mathematicae Graph Theory 25(3): 407-417 (2005) |
| 29 | | Mucuy-kak Guevara,
Hortensia Galeana-Sánchez:
New sufficient conditions for the existence of kernels in digraphs.
Electronic Notes in Discrete Mathematics 22: 287-290 (2005) |
| 28 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments.
Graphs and Combinatorics 21(3): 307-317 (2005) |
| 2004 |
|---|
| 27 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Kernels in pretransitive digraphs.
Discrete Mathematics 275(1-3): 129-136 (2004) |
| 26 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
A counterexample to a conjecture on edge-coloured tournaments.
Discrete Mathematics 282(1-3): 275-276 (2004) |
| 25 | | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments.
Discrete Mathematics 285(1-3): 313-318 (2004) |
| 2002 |
|---|
| 24 | | Hortensia Galeana-Sánchez:
Kernels in digraphs with covering number at most 3.
Discrete Mathematics 259(1-3): 121-135 (2002) |
| 2000 |
|---|
| 23 | | Hortensia Galeana-Sánchez:
Semikernels modulo F and kernels in digraphs.
Discrete Mathematics 218(1-3): 61-71 (2000) |
| 1998 |
|---|
| 22 | | Hortensia Galeana-Sánchez,
Xueliang Li:
Kernels in a special class of digraphs.
Discrete Mathematics 178(1-3): 73-80 (1998) |
| 21 | | Hortensia Galeana-Sánchez:
Kernels in edge-colored digraphs.
Discrete Mathematics 184(1-3): 87-99 (1998) |
| 20 | | Hortensia Galeana-Sánchez,
Xueliang Li:
Semikernels and (k, l)-Kernels in Digraphs.
SIAM J. Discrete Math. 11(2): 340-346 (1998) |
| 1997 |
|---|
| 19 | | Hortensia Galeana-Sánchez:
A characterization of normal fraternally orientable perfect graphs.
Discrete Mathematics 169(1-3): 221-225 (1997) |
| 18 | | Hortensia Galeana-Sánchez,
Sergio Rajsbaum:
Cycle-pancyclism in tournaments III.
Graphs and Combinatorics 13(1): 57-63 (1997) |
| 1996 |
|---|
| 17 | | Hortensia Galeana-Sánchez,
Hugo Alberto Rincón-Mejía:
Independent sets which meet all longest paths.
Discrete Mathematics 152(1-3): 141-145 (1996) |
| 16 | | Hortensia Galeana-Sánchez:
On monochromatic paths and monochromatic cycles in edge coloured tournaments.
Discrete Mathematics 156(1-3): 103-112 (1996) |
| 15 | | Hortensia Galeana-Sánchez,
Sergio Rajsbaum:
Cycle-pancyclism in tournaments II.
Graphs and Combinatorics 12(1): 9-16 (1996) |
| 1995 |
|---|
| 14 | | Hortensia Galeana-Sánchez:
B1- and B2-orientable graphs in kernel theory.
Discrete Mathematics 143(1-3): 269-274 (1995) |
| 13 | | Hortensia Galeana-Sánchez,
Sergio Rajsbaum:
Cycle-pancyclism in tournaments I.
Graphs and Combinatorics 11(3): 233-243 (1995) |
| 1994 |
|---|
| 12 | | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs.
Graphs and Combinatorics 10(2-4): 329-336 (1994) |
| 1993 |
|---|
| 11 | | Hortensia Galeana-Sánchez:
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture.
Discrete Mathematics 122(1-3): 167-177 (1993) |
| 1992 |
|---|
| 10 | | Hortensia Galeana-Sánchez:
On the existence of kernels and h-kernels in directed graphs.
Discrete Mathematics 110(1-3): 251-255 (1992) |
| 1991 |
|---|
| 9 | | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
Orientations of graphs in kernel theory.
Discrete Mathematics 87(3): 271-280 (1991) |
| 8 | | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
Extending kernel perfect digraphs to kernel perfect critical digraphs.
Discrete Mathematics 94(3): 181-187 (1991) |
| 7 | | 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. Discrete Math. 4(1): 80-83 (1991) |
| 1990 |
|---|
| 6 | | Hortensia Galeana-Sánchez:
On the existence of (k, l)-kernels in digraphs.
Discrete Mathematics 85(1): 99-102 (1990) |
| 1988 |
|---|
| 5 | | Hortensia Galeana-Sánchez:
A new method to extend kernel-perfect graphs to kernel-perfect critical graphs.
Discrete Mathematics 69(2): 207-209 (1988) |
| 1986 |
|---|
| 4 | | Hortensia Galeana-Sánchez:
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs.
Discrete Mathematics 59(1-2): 35-41 (1986) |
| 3 | | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
On kernel-perfect critical digraphs.
Discrete Mathematics 59(3): 257-265 (1986) |
| 1984 |
|---|
| 2 | | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
On kernels and semikernels of digraphs.
Discrete Mathematics 48(1): 67-76 (1984) |
| 1982 |
|---|
| 1 | | Hortensia Galeana-Sánchez:
A counterexample to a conjecture of meyniel on kernel-perfect graphs.
Discrete Mathematics 41(1): 105-107 (1982) |
Data released under the ODC-BY 1.0 license — See also our legal information page