Tournaments with kernels by monochromatic paths
Hortensia Galeana‐Sánchez, Eugenia O’Reilly-Regueiro · Libraries and Cultural Resources (University of Calgary) · 2010
In this paper we prove the existence of kernels by monochromatic paths in m-coloured tournaments in which every cyclic tournament of order 3 is atmost 2-coloured in addition to other restrictions on the colouring ofcertain subdigraphs. We point out that in all previous results on kernelsby monochromatic paths in arc coloured tournaments, certain smallsubstructures are required to be monochromatic or monochromatic with atmost one exception, whereas here we allow up to three colours in two smallsubstructures.