论文信息 - Vertex critical r-dichromatic tournaments

Vertex critical r-dichromatic tournaments

The dichromatic number d"k(D) of a digraph D is the minimum number of colours needed to colour V(D) in such a way that no monochromatic directed cycle is obtained. The digraph D is called v-critical r-dichromatic when d"k(D) = r and d"k(D - v) = r - 1 for any [email protected](D). In this paper we construct an infinite family of v-critical r-dichromatic regular tournaments for every r >= 3, r 4.

Jorge Urrutia | Victor Neumann-Lara

[1] Victor Neumann-Lara,et al. The dichromatic number of a digraph , 1982, J. Comb. Theory, Ser. B.

[2] Yahya Ould Hamidoune,et al. On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs , 1980, Discret. Math..