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 product of d graphs each of which is an induced path or cycle. This class includes some known classes of graphs like d-dimensional meshes, hypercubes, tori, etc. Our estimates are exact except when the graph is a product of a path and a number of odd cycles, in which case the estimates differ

• Type: Conference
• Year: 2006
• Where: COCOON
• Authors: Rahul Muthu, N. Narayanan, C. R. Subramanian
• Keywords: Acyclic Chromatic Index, Cartesian Product, COCOON 2006, Combinatorics, D-dimensional Partial Tori