2008 |
31 | EE | Hortensia Galeana-Sánchez,
Ricardo Gómez:
Independent sets and non-augmentable paths in generalizations of tournaments.
Discrete Mathematics 308(12): 2460-2472 (2008) |
30 | EE | Hortensia Galeana-Sánchez:
Kernels in edge-coloured orientations of nearly complete graphs.
Discrete Mathematics 308(20): 4599-4607 (2008) |
29 | EE | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Kernels and some operations in edge-coloured digraphs.
Discrete Mathematics 308(24): 6036-6046 (2008) |
2007 |
28 | EE | 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 |
27 | EE | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Kernels in quasi-transitive digraphs.
Discrete Mathematics 306(16): 1969-1974 (2006) |
26 | EE | Hortensia Galeana-Sánchez:
Kernels and perfectness in arc-local tournament digraphs.
Discrete Mathematics 306(19-20): 2473-2480 (2006) |
2005 |
25 | EE | 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) |
24 | EE | 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 |
23 | EE | Hortensia Galeana-Sánchez,
Rocío Rojas-Monroy:
Kernels in pretransitive digraphs.
Discrete Mathematics 275(1-3): 129-136 (2004) |
22 | EE | 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) |
21 | EE | 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 |
20 | EE | Hortensia Galeana-Sánchez:
Kernels in digraphs with covering number at most 3.
Discrete Mathematics 259(1-3): 121-135 (2002) |
2000 |
19 | EE | Hortensia Galeana-Sánchez:
Semikernels modulo F and kernels in digraphs.
Discrete Mathematics 218(1-3): 61-71 (2000) |
1998 |
18 | EE | Hortensia Galeana-Sánchez,
Xueliang Li:
Kernels in a special class of digraphs.
Discrete Mathematics 178(1-3): 73-80 (1998) |
17 | EE | Hortensia Galeana-Sánchez:
Kernels in edge-colored digraphs.
Discrete Mathematics 184(1-3): 87-99 (1998) |
16 | EE | Hortensia Galeana-Sánchez,
Xueliang Li:
Semikernels and (k, l)-Kernels in Digraphs.
SIAM J. Discrete Math. 11(2): 340-346 (1998) |
1997 |
15 | EE | Hortensia Galeana-Sánchez:
A characterization of normal fraternally orientable perfect graphs.
Discrete Mathematics 169(1-3): 221-225 (1997) |
1996 |
14 | EE | Hortensia Galeana-Sánchez,
H. A. Rincón-Mejía:
Independent sets which meet all longest paths.
Discrete Mathematics 152(1-3): 141-145 (1996) |
13 | EE | Hortensia Galeana-Sánchez:
On monochromatic paths and monochromatic cycles in edge coloured tournaments.
Discrete Mathematics 156(1-3): 103-112 (1996) |
1995 |
12 | EE | Hortensia Galeana-Sánchez:
B1- and B2-orientable graphs in kernel theory.
Discrete Mathematics 143(1-3): 269-274 (1995) |
1993 |
11 | EE | Hortensia Galeana-Sánchez:
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture.
Discrete Mathematics 122(1-3): 167-177 (1993) |
1992 |
10 | EE | 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 | EE | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
Orientations of graphs in kernel theory.
Discrete Mathematics 87(3): 271-280 (1991) |
8 | EE | 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,
L. Pastrana Ramírez,
H. A. 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 | EE | Hortensia Galeana-Sánchez:
On the existence of (k, l)-kernels in digraphs.
Discrete Mathematics 85(1): 99-102 (1990) |
1988 |
5 | EE | 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 | EE | 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 | EE | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
On kernel-perfect critical digraphs.
Discrete Mathematics 59(3): 257-265 (1986) |
1984 |
2 | EE | Hortensia Galeana-Sánchez,
Victor Neumann-Lara:
On kernels and semikernels of digraphs.
Discrete Mathematics 48(1): 67-76 (1984) |
1982 |
1 | EE | Hortensia Galeana-Sánchez:
A counterexample to a conjecture of meyniel on kernel-perfect graphs.
Discrete Mathematics 41(1): 105-107 (1982) |