Vertex critical 4-dichromatic circulant tournaments. (English) Zbl 0876.05039

Summary: An infinite family of vertex critical 4-dichromatic circulant tournaments is presented, answering a problem posed by V. Neumann-Lara and J. Urrutia [Discrete Math. 49, 83-87 (1984; Zbl 0532.05031)].


05C20 Directed graphs (digraphs), tournaments
05C15 Coloring of graphs and hypergraphs


Zbl 0532.05031
Full Text: DOI


[1] Erdös, P., Problems and results in number theory and graph theory, (Proc. 9th Manitoba Conf. Numer. Math. and Computing (1979)), 3-21
[3] Neumann-Lara, V., The dichromatic number of a digraph, J. Combin. Theory Ser. B, 33, 265-270 (1982) · Zbl 0506.05031
[4] Neumann-Lara, V., The 3 and 4-dichromatic tournaments of minimum order, Discrete Math., 135, 233-243 (1994) · Zbl 0829.05028
[5] Neumann-Lara, V.; Urrutia, J., Vertex critical \(r\)-dichromatic tournaments, Discrete Math., 40, 83-87 (1984) · Zbl 0532.05031
[6] Reid, K. B.; Parker, E. T., Disproof of a conjecture of Erdös and Moser on tournaments, J. Combin. Theory, 9, 225-238 (1970) · Zbl 0204.24605
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.