Paths with two blocks in n-chromatic digraphs

@article{AddarioBerry2007PathsWT,
  title={Paths with two blocks in n-chromatic digraphs},
  author={Louigi Addario-Berry and Fr{\'e}d{\'e}ric Havet and St{\'e}phan Thomass{\'e}},
  journal={J. Comb. Theory, Ser. B},
  year={2007},
  volume={97},
  pages={620-626}
}
We show that every oriented path of order n ≥ 4 with two blocks is contained in every n-chromatic digraph.