Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: vertex-critical

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Dichromatic number, circulant tournaments and Zykov sums of digraphs

100%

Neumann-Lara V.

Discussiones Mathematicae Graph Theory

2000

tom 20

nr 2

197-207

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Neumann-Lara V.

1 2000

Wyniki wyszukiwania

Dichromatic number, circulant tournaments and Zykov sums of digraphs