Yaojun Chen

Hamiltonian Digraphs Meet Two-Block Cycle Coloring Bound

A degeneracy argument for $C(k,\ell)$-free Hamiltonian digraphs proves $\chi(D) \leq k+\ell-1$ for $k+\ell \geq 6$, matching lower-bound examples.