Coloring Digraphs with Forbidden Cycles

Zhibin Chen, Jie Ma, Wenan Zang

Let $k$ and $r$ be two integers with $k\ge 2$ and $k\ge r\ge 1$. In this paper we show that (1) if a strongly connected digraph $D$ contains no directed cycle of length $1$ modul…