- Tytuł:
- Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments
- Autorzy:
-
Galeana-Sanchez, Hortensia
Rojas-Monroy, Rocío - Powiązania:
- https://bibliotekanauki.pl/articles/743320.pdf
- Data publikacji:
- 2008
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
kernel
kernel by monochromatic paths
bipartite tournament - Opis:
-
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A directed cycle is called quasi-monochromatic if with at most one exception all of its arcs are coloured alike. A set N ⊆ V(D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions:
(i) for every pair of different vertices u,v ∈ N there is no monochromatic directed path between them and
(ii) for every vertex x ∈ V(D)∖N there is a vertex y ∈ N such that there is an xy-monochromatic directed path.
In this paper it is proved that if D is an m-coloured bipartite tournament such that: every directed cycle of length 4 is quasi-monochromatic, every directed cycle of length 6 is monochromatic, and D has no induced particular 6-element bipartite tournament T̃₆, then D has a kernel by monochromatic paths. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2008, 28, 2; 285-306
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł