Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks

n-vertex edge coloured graphs with multiplicity of Jordan blocks bounded by k can be done in time .