ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 31(4) (2011)
Instituto de Matemáticas U.N.A.M. 'Area de la investigación cient'ifica Circuito Exterior, Ciudad Universitaria Coyoacán 04510, México, D.F. México
In this paper we prove different sufficient conditions which imply that an
arc-colored tournament has a kernel by monochromatic paths. Our conditions
concerns to some subdigraphs of T and its quasimonochromatic and bicolor
coloration. We also prove that our conditions are not mutually implied and
that they are not implied by those known previously. Besides some open
problems are proposed.
Keywords: kernel, kernel by monochromatic paths, tournament
2010 Mathematics Subject Classification: 05C20, 05C38, 05C69.
Received 20 September 2007 Revised 8 December 2010 Accepted 8 December 2010