Upper bounds for the automorphic chromatic index of a graph

The automorphic H-chromatic index of a graph G is the minimum integer m for which G has a proper edge-coloring with m colors preserved by a given subgroup H of the full automorphism group of G. We determine upper bounds for this index in terms of the chromatic index of G for some abelian 2-groups H