Elsevier

Discrete Mathematics

Volume 307, Issue 23, 6 November 2007, Pages 3063-3069
Discrete Mathematics

Note
Improved bounds on acyclic edge colouring

https://doi.org/10.1016/j.disc.2007.03.006Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove that the acyclic chromatic index a(G)6Δ for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52Δ with the girth requirement g220. We also obtain a relationship between g and a(G).

Keywords

Acyclic graph edge colouring
Graph
Edge chromatic index

Cited by (0)