The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hortensia Galeana-Sánchez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hortensia Galeana-Sánchez
    Semikernels modulo F and kernels in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:61-71 [Journal]
  2. Hortensia Galeana-Sánchez
    Kernels in digraphs with covering number at most 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:121-135 [Journal]
  3. Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
    A counterexample to a conjecture on edge-coloured tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:275-276 [Journal]
  4. Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
    On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:313-318 [Journal]
  5. Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
    Kernels in pretransitive digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:275, n:1-3, pp:129-136 [Journal]
  6. Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
    Kernels in quasi-transitive digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1969-1974 [Journal]
  7. Hortensia Galeana-Sánchez
    Kernels and perfectness in arc-local tournament digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2473-2480 [Journal]
  8. Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
    Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:307-317 [Journal]
  9. Hortensia Galeana-Sánchez, Xueliang Li
    Semikernels and (k, l)-Kernels in Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:2, pp:340-346 [Journal]
  10. Hortensia Galeana-Sánchez, L. Pastrana Ramírez, H. A. Rincón-Mejía
    Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:80-83 [Journal]
  11. Hortensia Galeana-Sánchez
    A counterexample to a conjecture of meyniel on kernel-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:105-107 [Journal]
  12. Hortensia Galeana-Sánchez
    A theorem about a conjecture of H. Meyniel on kernel-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:1-2, pp:35-41 [Journal]
  13. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    On kernel-perfect critical digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:3, pp:257-265 [Journal]
  14. Hortensia Galeana-Sánchez
    A new method to extend kernel-perfect graphs to kernel-perfect critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:2, pp:207-209 [Journal]
  15. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    On kernels and semikernels of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:1, pp:67-76 [Journal]
  16. Hortensia Galeana-Sánchez
    Kernels in edge-colored digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:184, n:1-3, pp:87-99 [Journal]
  17. Hortensia Galeana-Sánchez, Xueliang Li
    Kernels in a special class of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:178, n:1-3, pp:73-80 [Journal]
  18. Hortensia Galeana-Sánchez
    A characterization of normal fraternally orientable perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:221-225 [Journal]
  19. Hortensia Galeana-Sánchez
    On the existence of (k, l)-kernels in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:99-102 [Journal]
  20. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    Orientations of graphs in kernel theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:3, pp:271-280 [Journal]
  21. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    Extending kernel perfect digraphs to kernel perfect critical digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:181-187 [Journal]
  22. Hortensia Galeana-Sánchez
    On the existence of kernels and h-kernels in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:251-255 [Journal]
  23. Hortensia Galeana-Sánchez
    B1- and B2-orientable graphs in kernel theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:143, n:1-3, pp:269-274 [Journal]
  24. Hortensia Galeana-Sánchez, H. A. Rincón-Mejía
    Independent sets which meet all longest paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:141-145 [Journal]
  25. Hortensia Galeana-Sánchez
    On monochromatic paths and monochromatic cycles in edge coloured tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:103-112 [Journal]
  26. Hortensia Galeana-Sánchez
    Normal fraternally orientable graphs satisfy the strong perfect graph conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:167-177 [Journal]

  27. Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs. [Citation Graph (, )][DBLP]


  28. Kernels in edge-coloured orientations of nearly complete graphs. [Citation Graph (, )][DBLP]


  29. Kernels and some operations in edge-coloured digraphs. [Citation Graph (, )][DBLP]


  30. Independent sets and non-augmentable paths in generalizations of tournaments. [Citation Graph (, )][DBLP]


  31. Some sufficient conditions for the existence of kernels in infinite digraphs. [Citation Graph (, )][DBLP]


  32. On the structure of strong 3-quasi-transitive digraphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002