Aug 6, 2004 · In this paper it is proved that if D is an m-coloured bipartite tournament such that every directed cycle of length 4 is monochromatic, then D ...

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

In this paper it is proved that if D is an m-coloured bipartite tournament such that every directed cycle of length 4 is monochromatic, then D has a kernel by ...

A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike.A set N⊆V(D) is said to be a kernel by monochromatic paths ...

On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments. by Rocío Rojas Monroy. 2004, Discrete Mathematics. See Full PDF

TL;DR: This paper introduces the concept of semikernel modulo i by monochromatic paths of an m-coloured digraph and deals with bipartite tournaments such that A ...

Rojas-Monroy, On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments, Discrete Math. 285 (2004) 313–318. Page 12. 360. H ...

In this paper it is proved that if D is an m-coloured bipartite tournament such that: every directed cycle of length 4 is quasi-monochromatic, every directed ...

On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments. Discrete Mathematics, 285(1):313--318, 2004. galeana05 H. Galeana ...

A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every ...