# $d$-Regular graphs of acyclic chromatic index at least $d 2$

$d$-Regular graphs of acyclic chromatic index at least $d 2$ - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: $d$-Regular graphs of acyclic chromatic index at least $d 2$
An $acyclic$ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by $a-(G)$. It was conjectured by Alon, Sudakov and Zaks (and earlier by Fiamcik) that \$a-(G)\le \D

Author: Manu Basavaraju; L. Sunil Chandran; Manoj Kummini

Source: https://archive.org/