Monochromatic absorbency and independence in 3-quasi-transitive digraphs
Hortensia Galeana-Sand, Eugenia O’Reilly-Regueiro · 2013
We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. In an m-coloured digraph D we say that a subdigraph H is: monochromatic whenever all of its arcs are coloured alike, and almost monochromatic if with at most 1 exception all of its arcs are coloured with the same colour. If D is an m-coloured digraph a kmp or a kernel by monochromatic paths of D is a set K of vertices of D which is independent by monochromatic paths (for any two dierent vertices