- Tytuł:
- Dichromatic number, circulant tournaments and Zykov sums of digraphs
- Autorzy:
- Neumann-Lara, Víctor
- Powiązania:
- https://bibliotekanauki.pl/articles/743771.pdf
- Data publikacji:
- 2000
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
digraphs
dichromatic number
vertex-critical
Zykov sums
tournaments
circulant
covering numbers in hypergraphs - Opis:
- The dichromatic number dc(D) of a digraph D is the smallest number of colours needed to colour the vertices of D so that no monochromatic directed cycle is created. In this paper the problem of computing the dichromatic number of a Zykov-sum of digraphs over a digraph D is reduced to that of computing a multicovering number of an hypergraph H₁(D) associated to D in a natural way. This result allows us to construct an infinite family of pairwise non isomorphic vertex-critical k-dichromatic circulant tournaments for every k ≥ 3, k ≠ 7.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2000, 20, 2; 197-207
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł