Sciweavers

DM
2007
100views more  DM 2007»
13 years 10 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
COCOON
2006
Springer
14 years 2 months ago
Optimal Acyclic Edge Colouring of Grid Like Graphs
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
Rahul Muthu, N. Narayanan, C. R. Subramanian
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
14 years 5 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian