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 29(1) (2009)
Pietra Delgado-Escalante and Hortensia Galeana-Sánchez
Instituto de Matemáticas
U.N.A.M. Área de la investigación científica
Circuito Exterior, Ciudad Universitaria
Coyoacán 04510, México, D.F. México
In this paper we prove that if T is an arc-colored tournament which does
not contain certain subdivisions of cycles then it possesses a kernel by
monochromatic paths. These results generalize a well known sufficient
condition for the existence of a kernel by monochromatic paths obtained by
Shen Minggang in 1988 and another one obtained by Hahn et al. in 2004.
Some open problems are proposed.
Keywords: kernel, kernel by monochromatic paths, tournament.
2000 Mathematics Subject Classification: 05C20, 05C38, 05C69.
Received 30 January 2007
Revised 3 December 2008
Accepted 3 December 2008