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

arXiv1209.2471MaRDI QIDQ6235598FDOQ6235598

Authors: Wang Weifan, Shu Qiaojun, Wang Yiqiao 

Publication date: 11 September 2012

Abstract: An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a^{\prime }(G)$ of $G$ is the smallest integer $k$ such that $G$ has an acyclic edge coloring using $k$ colors. Fiam$mcheckc$ik (1978) and later Alon, Sudakov and Zaks (2001) conjectured that $a^{\prime }(G)leDelta+2$ for any simple graph $G$ with maximum degree $Delta$. Basavaraju and Chandran (2009) showed that every graph $G$ with $Delta=4$, which is not 4-regular, satisfies the conjecture. In this paper, we settle the 4-regular case, i.e., we show that every 4-regular graph $G$ has $a^{\prime }(G)le6$.

This page was built for publication: Every 4-regular graph is acyclically edge-6-colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6235598)