Hortensia Galeana-Sánchez

According to our database1, Hortensia Galeana-Sánchez authored at least 125 papers between 1982 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Richardson's theorem in quasi-transitive and pre-transitive digraphs.
Graphs Comb., 2020

Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs.
Discret. Appl. Math., 2020

2019
A dichotomy for the kernel by H-walks problem in digraphs.
J. Graph Theory, 2019

Some Conditions for the Existence of Euler H-trails.
Graphs Comb., 2019

New Bounds for the Dichromatic Number of a Digraph.
Discret. Math. Theor. Comput. Sci., 2019

Alternating Hamiltonian cycles in 2-edge-colored multigraphs.
Discret. Math. Theor. Comput. Sci., 2019

About <i>(k, l)</i>-kernels, semikernels and Grundy functions in partial line digraphs.
Discuss. Math. Graph Theory, 2019

Unions of digraphs which become kernel perfect.
Discret. Appl. Math., 2019

On the Fibonacci numbers of the composition of graphs.
Discret. Appl. Math., 2019

Characterization of color patterns by dynamic H-paths.
Discret. Appl. Math., 2019

H-kernels by walks in an RH(D) digraph.
AKCE Int. J. Graphs Comb., 2019

(A, ℬ)-kernels and Sands, Sauer and Woodrow's theorem.
AKCE Int. J. Graphs Comb., 2019

2018
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., 2018

Alternating kernels.
Discret. Appl. Math., 2018

Quasi-Transitive Digraphs and Their Extensions.
Proceedings of the Classes of Directed Graphs., 2018

2017
A Richardson's theorem version for ⊓-kernels.
Discret. Math., 2017

Infinite quasi-transitive digraphs with domination number 2.
Discret. Appl. Math., 2017

A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs.
Discret. Appl. Math., 2017

2016
A Characterization of Locally Semicomplete CKI-digraphs.
Graphs Comb., 2016

Richardson's Theorem in H-coloured Digraphs.
Graphs Comb., 2016

CKI-Digraphs, Generalized Sums and Partitions of Digraphs.
Graphs Comb., 2016

Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs.
Electron. Notes Discret. Math., 2016

Kernels by monochromatic paths and color-perfect digraphs.
Discuss. Math. Graph Theory, 2016

<i>?</i>-cycles in arc-colored digraphs.
Discuss. Math. Graph Theory, 2016

On panchromatic patterns.
Discret. Math., 2016

Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs.
Discret. Math., 2016

Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs.
Discret. Appl. Math., 2016

Richardson's Theorem for k-colored kernels in strongly connected digraphs.
Discret. Appl. Math., 2016

H-kernels by walks in H-colored digraphs and the color-class digraph.
AKCE Int. J. Graphs Comb., 2016

2015
On Panchromatic Digraphs and the Panchromatic Number.
Graphs Comb., 2015

Π-Kernels in Digraphs.
Graphs Comb., 2015

An Extension of Richardson's Theorem in m-Colored Digraphs.
Graphs Comb., 2015

H-Paths and H-Cycles in H-Coloured Digraphs.
Graphs Comb., 2015

H-kernels and H-obstructions in H-colored digraphs.
Discret. Math., 2015

New classes of panchromatic digraphs.
AKCE Int. J. Graphs Comb., 2015

The Fibonacci numbers of certain subgraphs of circulant graphs.
AKCE Int. J. Graphs Comb., 2015

Independent and monochromatic absorbent sets in infinite digraphs.
AKCE Int. J. Graphs Comb., 2015

Cycles and transitivity by monochromatic paths in arc-coloured digraphs.
AKCE Int. J. Graphs Comb., 2015

2014
On the existence of (<i>k, l</i>)-kernels in infinite digraphs: A survey.
Discuss. Math. Graph Theory, 2014

Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor.
Discret. Math., 2014

2013
H-Kernels in Infinite Digraphs.
Graphs Comb., 2013

γ-cycles and transivity by monochromatic paths in arc-coloured digraphs.
Discuss. Math. Graph Theory, 2013

Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3.
Discret. Math., 2013

On the existence and number of (<i>k</i>+1)(k+1)-kings in <i>k</i>k-quasi-transitive digraphs.
Discret. Math., 2013

The Path Partition Conjecture is true for some generalizations of tournaments.
Discret. Math., 2013

2012
k-kernels in k-transitive and k-quasi-transitive digraphs.
Discret. Math., 2012

A classification of all arc-locally semicomplete digraphs.
Discret. Math., 2012

A new characterization of perfect graphs.
Discret. Math., 2012

k-colored kernels.
Discret. Appl. Math., 2012

On the existence and number of (k+1)-kings in k-quasi-transitive digraphs
CoRR, 2012

Tournaments with kernels by monochromatic paths.
Contributions Discret. Math., 2012

Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes.
Ars Comb., 2012

2011
<i>k</i>-kernels in generalizations of transitive digraphs.
Discuss. Math. Graph Theory, 2011

Cyclically k-partite digraphs and k-kernels.
Discuss. Math. Graph Theory, 2011

Monochromatic cycles and monochromatic paths in arc-colored digraphs.
Discuss. Math. Graph Theory, 2011

Kernels by monochromatic paths and the color-class digraph.
Discuss. Math. Graph Theory, 2011

On monochromatic paths and bicolored subdigraphs in arc-colored tournaments.
Discuss. Math. Graph Theory, 2011

Kernels by monochromatic paths in digraphs with covering number 2.
Discret. Math., 2011

H-kernels in the D-join.
Ars Comb., 2011

2010
Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs.
Discuss. Math. Graph Theory, 2010

On the structure of strong 3-quasi-transitive digraphs.
Discret. Math., 2010

Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs.
Discret. Appl. Math., 2010

2009
A classification of arc-locally semicomplete digraphs.
Electron. Notes Discret. Math., 2009

Monochromatic paths and monochromatic sets of arcs in bipartite tournaments.
Discuss. Math. Graph Theory, 2009

Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs.
Discuss. Math. Graph Theory, 2009

<i>k</i>-Kernels and some operations in digraphs.
Discuss. Math. Graph Theory, 2009

Directed hypergraphs: A tool for researching digraphs and hypergraphs.
Discuss. Math. Graph Theory, 2009

Independent transversals of longest paths in locally semicomplete and transitive digraphs.
Discuss. Math. Graph Theory, 2009

Kernels and cycles' subdivisions in arc-colored tournaments.
Discuss. Math. Graph Theory, 2009

Some sufficient conditions for the existence of kernels in infinite digraphs.
Discret. Math., 2009

Alternating Domination In Arc-Colored Digraphs.
Ars Comb., 2009

2008
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments.
Discuss. Math. Graph Theory, 2008

Kernels and some operations in edge-coloured digraphs.
Discret. Math., 2008

Independent sets and non-augmentable paths in generalizations of tournaments.
Discret. Math., 2008

Kernels in edge-coloured orientations of nearly complete graphs.
Discret. Math., 2008

Absorbent sets and kernels by monochromatic directed paths in m-colored tournaments.
Australas. J Comb., 2008

2007
Kernel perfect and critical kernel imperfect digraphs structure.
Electron. Notes Discret. Math., 2007

Monochromatic kernel-perfectness of special classes of digraphs.
Discuss. Math. Graph Theory, 2007

<i>(k, l)-</i>kernels, <i>(k, l)-</i>semikernels, <i>k-</i>Grundy functions and duality for state splittings.
Discuss. Math. Graph Theory, 2007

2006
Kernels in quasi-transitive digraphs.
Discret. Math., 2006

Kernels and perfectness in arc-local tournament digraphs.
Discret. Math., 2006

2005
Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments.
Graphs Comb., 2005

New sufficient conditions for the existence of kernels in digraphs.
Electron. Notes Discret. Math., 2005

Kernels in monochromatic path digraphs.
Discuss. Math. Graph Theory, 2005

2004
On the heterochromatic number of circulant digraphs.
Discuss. Math. Graph Theory, 2004

Cycle-pancyclism in bipartite tournaments II.
Discuss. Math. Graph Theory, 2004

Cycle-pancyclism in bipartite tournaments I.
Discuss. Math. Graph Theory, 2004

Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel.
Discuss. Math. Graph Theory, 2004

Kernels in pretransitive digraphs.
Discret. Math., 2004

On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments.
Discret. Math., 2004

A counterexample to a conjecture on edge-coloured tournaments.
Discret. Math., 2004

2002
Kernels in digraphs with covering number at most 3.
Discret. Math., 2002

2001
On graphs all of whose {C<sub>3</sub>, T<sub>3</sub>}-free arc colorations are kernel-perfect.
Discuss. Math. Graph Theory, 2001

2000
A class of tight circulant tournaments.
Discuss. Math. Graph Theory, 2000

Kernels in the closure of coloured digraphs.
Discuss. Math. Graph Theory, 2000

Semikernels modulo <i>F</i> and kernels in digraphs.
Discret. Math., 2000

1998
Semikernels and (<i>k, l</i>)-Kernels in Digraphs.
SIAM J. Discret. Math., 1998

A conjecture on cycle-pancyclism in tournaments.
Discuss. Math. Graph Theory, 1998

A sufficient condition for the existence of k-kernels in digraphs.
Discuss. Math. Graph Theory, 1998

Kernels in edge coloured line digraph.
Discuss. Math. Graph Theory, 1998

New classes of critical kernel-imperfect digraphs.
Discuss. Math. Graph Theory, 1998

On independent sets and non-augmentable paths in directed graphs.
Discuss. Math. Graph Theory, 1998

Kernels in a special class of digraphs.
Discret. Math., 1998

Kernels in edge-colored digraphs.
Discret. Math., 1998

1997
Cycle-pancyclism in tournaments III.
Graphs Comb., 1997

A characterization of normal fraternally orientable perfect graphs.
Discret. Math., 1997

1996
On claw-free <i>M</i>-oriented critical kernel-imperfect digraphs.
J. Graph Theory, 1996

Cycle-pancyclism in tournaments II.
Graphs Comb., 1996

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition.
Discuss. Math. Graph Theory, 1996

Independent sets which meet all longest paths.
Discret. Math., 1996

On monochromatic paths and monochromatic cycles in edge coloured tournaments.
Discret. Math., 1996

1995
Cycle-pancyclism in tournaments I.
Graphs Comb., 1995

B<sub>1</sub>- and B<sub>2</sub>-orientable graphs in kernel theory.
Discret. Math., 1995

1994
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs.
Graphs Comb., 1994

1993
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture.
Discret. Math., 1993

1992
On the existence of kernels and h-kernels in directed graphs.
Discret. Math., 1992

1991
Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph.
SIAM J. Discret. Math., 1991

Extending kernel perfect digraphs to kernel perfect critical digraphs.
Discret. Math., 1991

Orientations of graphs in kernel theory.
Discret. Math., 1991

1990
On the existence of (k, l)-kernels in digraphs.
Discret. Math., 1990

1988
A new method to extend kernel-perfect graphs to kernel-perfect critical graphs.
Discret. Math., 1988

1986
On kernel-perfect critical digraphs.
Discret. Math., 1986

A theorem about a conjecture of H. Meyniel on kernel-perfect graphs.
Discret. Math., 1986

1984
On kernels and semikernels of digraphs.
Discret. Math., 1984

1982
A counterexample to a conjecture of meyniel on kernel-perfect graphs.
Discret. Math., 1982


  Loading...