• Mathematics, Computer Science
  • Published in
    Discussiones Mathematicae…
    2017
  • DOI:10.7151/dmgt.1930

The Dichromatic Number of Infinite Families of Circulant Tournaments

@article{Javier2017TheDN,
  title={The Dichromatic Number of Infinite Families of Circulant Tournaments},
  author={Nahid Javier and Bernardo Llano},
  journal={Discussiones Mathematicae Graph Theory},
  year={2017},
  volume={37},
  pages={221 - 238}
}
Abstract The dichromatic number dc(D) of a digraph D is defined to be the minimum number of colors such that the vertices of D can be colored in such a way that every chromatic class induces an acyclic subdigraph in D. The cyclic circulant tournament is denoted by T=C→2n+1(1,2,…,n) $T = \overrightarrow C _{2n + 1} (1,2, \ldots ,n)$ , where V (T) = ℤ2n+1 and for every jump j ∈ {1, 2, . . . , n} there exist the arcs (a, a + j) for every a ∈ ℤ2n+1. Consider the circulant tournament C→2n+1〈k… CONTINUE READING

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

The dichromatic number of a digraph

  • J. Comb. Theory, Ser. B
  • 1982
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Theory, Algorithms and Applications, Second Edition (Springer Monographs in Mathematics

J. Bang-Jensen, G. Gutin, Digraphs
  • 2009

Extensions of Turan ’ s and Brooks theorem and new notions of stability and colouring in digraphs

H. Jacob, H. Meyniel
  • J . Graph Theory
  • 1991