#### Filter Results:

- Full text PDF available (47)

#### Publication Year

1982

2019

- This year (10)
- Last 5 years (36)
- Last 10 years (77)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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

- 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 (k, l)-kernel N of D is a k-independent (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if… (More)

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

- 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, Victor Neumann-Lara
- Discrete Mathematics
- 1991

Galeana-SBnchez, H. and V. Neumann-Lara, Extending kernel perfect digraphs to kernel perfect critical digraphs, Discrete Mathematics 94 (1991) 181-187. In this paper we prove that any R-digraph is an… (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 ofV (D). Given a digraphD, we say thatD 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, Sergio Rajsbaum
- Graphs and Combinatorics
- 1995

LetT be a hamiltonian tournament withn vertices andγ a hamiltonian cycle ofT. In this paper we start the study of the following question: What is the maximum intersection withγ of a cycle of lengthk?… (More)

- Hortensia Galeana-Sánchez, Xueliang Li
- Discrete Mathematics
- 1998