#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2004

2019

- This year (2)
- Last 5 years (6)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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, 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)

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

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

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

Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A kernel N of D is an independent set of vertices such that for every w?V(D)-N there exists an arc from… (More)

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

Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. A kernel N of D is an independent set of vertices such that for every w@?V(D)-N there exists an arc… (More)

A digraph D is called anm-coloured digraph if its arcs are coloured withm colors. Let D be an m-coloured digraph. A subdigraph H of D is called monochromatic if all of its arcs are coloured alike and… (More)

- Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala
- Discussiones Mathematicae Graph Theory
- 2009

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 set N of vertices of D is… (More)

- Hortensia Galeana-Sánchez, G. Gaytán-Gómez, Rocío Rojas-Monroy
- Discussiones Mathematicae Graph Theory
- 2011

We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A path (or a cycle) is called monochromatic if all of its arcs are colored alike. A cycle is called a… (More)

- Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala
- Discussiones Mathematicae Graph Theory
- 2010

- Hortensia Galeana-Sánchez, Rocío Rojas-Monroy, B. Zavala
- Discussiones Mathematicae Graph Theory
- 2009

We call the digraphD anm-coloured digraph if the arcs of D are coloured withm colours and all of them are used. A directed path is called monochroma tic if ll of its arcs are coloured alike. A setN… (More)