#### Filter Results:

- Full text PDF available (48)

#### Publication Year

1982

2019

- This year (11)
- Last 5 years (39)
- Last 10 years (80)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hortensia Galeana-Sánchez, Victor Neumann-Lara
- Discrete Mathematics
- 1984

A kernel N of a digraph D is an independent set of vertices of D such that for every w @? V(D) - N there exists an arc from w to N. If every induced subdigraph of D has a kernel, D is said to be an… (More)

- Hortensia Galeana-Sánchez
- Discrete Mathematics
- 1996

Abstract We call the tournament T an m-coloured tournament if the arcs of T are coloured with m colours. A directed cycle is called a quasi-monochromatic cycle if with at most one exception all of… (More)

- César Hernández-Cruz, Hortensia Galeana-Sánchez
- Discrete Mathematics
- 2012

Let D be a digraph, V ( D ) and A ( D ) will denote the sets of vertices and arcs of D , respectively. A subset N of V ( D ) is k -independent if for every pair of vertices u , v ? N , we have d ( u… (More)

- Hortensia Galeana-Sánchez, Victor Neumann-Lara
- Discrete Mathematics
- 1986

In this paper we investigate new sufficient conditions for a digraph to be kernel-perfect (KP) and some structural properties of kernel-perfect critical (KPC) digraphs. In particular, it is proved… (More)

- Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
- Graphs and Combinatorics
- 2005

We call the tournament T an m-coloured tournament if the arcs of T are coloured with m-colours. If v is a vertex of an m-coloured tournament T, we denote by ξ(v) the set of colours assigned to the… (More)

- Hortensia Galeana-Sánchez, Ilan A. Goldfeder, Isabel Urrutia
- Discrete Mathematics
- 2010

In this paper, D=(V(D),A(D)) denotes a loopless directed graph (digraph) with at most one arc from u to v for every pair of vertices u and v of V(D). Given a digraph D, we say that D is… (More)

- Hortensia Galeana-Sánchez, Ricardo Gómez
- Discrete Mathematics
- 2008

We study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting every non-augmentable path (in particular,… (More)

- Hortensia Galeana-Sánchez, Victor Neumann-Lara
- Discrete Mathematics
- 1991

Abstract In this paper we prove that any R -digraph is an induced subdigraph of an infinite set of R -digraphs. The method employed in the proof can be used as a powerful tool in the construction of… (More)

- Hortensia Galeana-Sánchez
- Discrete Mathematics
- 1998

Abstract We call the digraph D an m -coloured digraph if the arcs of D are coloured with m colours. A directed path is called monochromatic if all of its arcs are coloured alike. A directed cycle is… (More)

- Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
- Discrete Mathematics
- 2004

We call the tournament T an m-coloured tournament if the arcs of T are coloured with m colours. In this paper we prove that for each n>=6, there exists a 4-coloured tournament T"n of order n… (More)