In this paper it is proved that the minimum order of a 3-dichromatic (resp. 4-dichromatic) tournament is 7 (resp. 11). It is also proved that there are exactly ...

Spanning 2-strong tournaments in 3-strong semicomplete digraphs. We prove that every 3-strong semicomplete digraph on at least 5 vertices contains a spanning 2- ...

... minimum order of a 3-dichromatic (resp. 4-dichromatic) tournament is 7 (resp. ... tournaments of order 7 and a unique 4-dichromatic tournament of order 11.

The 3-and 4-dichromatic tournaments of minimum order. Discrete Math. (1994). V. Neumann-Lara. Note on vertex critical 4-dichromatic circulant tournaments ...

Jun 10, 2024 · Vertex critical 4-dichromatic circulant tournaments. Discret ... The 3 and 4-dichromatic tournaments of minimum order. Discret. Math ...

[4] V. Neumann-Lara, The 3 and 4-dichromatic tournaments of minimum order, Discrete Math. 135 (1994). 233-243. [5] V. Neumann-Lara and J. Urrutia, Vertex ...

Neumann-Lara, The 3 and 4-dichromatic tournaments of minimum order,. Discrete Math. 135 (1984), 233–243. [12] V. Neumann-Lara and M. Olsen, Molds of regular ...

Oct 18, 2022 · It is known that the smallest 2-, 3- and 4-chromatic oriented graphs have 3, 7 and 11 vertices, respectively. In 1994, Neumann-Lara ...

... dichromatic regular tournaments for every r ⩾ 3, r ≠ 4. View. Show abstract. The 3 and 4-dichromatic tournaments of minimum order. Article. Dec 1994; DISCRETE ...

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.