- Tytuł:
- On monochromatic paths and bicolored subdigraphs in arc-colored tournaments
- Autorzy:
-
Delgado-Escalante, Pietra
Galeana-Sánchez, Hortensia - Powiązania:
- https://bibliotekanauki.pl/articles/743637.pdf
- Data publikacji:
- 2011
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
kernel
kernel by monochromatic paths
tournament - Opis:
- Consider an arc-colored digraph. A set of vertices N is a kernel by monochromatic paths if all pairs of distinct vertices of N have no monochromatic directed path between them and if for every vertex v not in N there exists n ∈ N such that there is a monochromatic directed path from v to n. 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2011, 31, 4; 791-820
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł