Sciweavers

DM
2007
100views more  DM 2007»
13 years 4 months ago
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 al...
Rahul Muthu, N. Narayanan, C. R. Subramanian