English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A cycle with four blocks $C(k_{1}, k_{2},k_{3},k_{4})$ is an oriented cycleformed of four blocks of lengths $k_{1}, k_{2}, k_{3}$ and $k_{4}$respectively. Recently, Cohen et al. conjectured that for every positiveintegers $k_{1}, k_{2}, k_{3}, k_{4}$, there is an integer$g(k_{1},k_{2},k_{3},k_{4})$ such that every strongly connected digraph $D$containing no subdivisions of $C(k_{1},k_{2},k_{3},k_{4})$ has a chromaticnumber at most $g(k_{1},k_{2},k_{3},k_{4})$. This conjecture is confirmed byCohen et al. for the case of $C(1,1,1,1)$ and by Al-Mniny for the case of$C(k_1,1,1,1)$. In this paper, we affirm Cohen et al.'s conjecture for the casewhere $k_2=k_4=1$, namely $g(k_1,1,k_3,1) =O({(k_1+k_3)}^2)$. Moreover, we showthat if in addition $D$ is Hamiltonian, then the chromatic number of $D$ is atmost $6k$, with $k=\textrm{max}\{k_1,k_3\}.$

About subdivisions of four blocks cycles $C(k_1,1,k_3,1)$ in digraphs with large chromatic number