Improved bounds on acyclic edge colouring

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 g 220. We also obtain a relationship between g and a (G). © 2007 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: DM
• Authors: Rahul Muthu, N. Narayanan, C. R. Subramanian
• Keywords: Acyclic Chromatic Index, Chromatic, DM 2007, Girth Requirement