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

An acyclic edge coloring of a graph $G$ is a proper edge coloring such thatno bichromatic cycles are produced. The acyclic chromatic index $a'(G)$ of $G$is the smallest integer $k$ such that $G$ has an acyclic edge coloring using$k$ colors. Fiam${\rm \check{c}}$ik (1978) and later Alon, Sudakov and Zaks(2001) conjectured that $a'(G)\le \Delta + 2$ for any simple graph $G$ withmaximum degree $\Delta$. Basavaraju and Chandran (2009) showed that every graph$G$ with $\Delta=4$, which is not 4-regular, satisfies the conjecture. In thispaper, we settle the 4-regular case, i.e., we show that every 4-regular graph$G$ has $a'(G)\le 6$.

Every 4-regular graph is acyclically edge-6-colorable