We determine (partly by computer search) the chromatic index (edge-chromatic number) of
many strongly regular graphs (SRGs), including the SRGs of degree $ k\leq 18$ and their …

A G-decomposition of a graph H consists of a set V of vertices of H together with a set B of
subgraphs (called blocks) of H, each isomorphic to G, that partition the edge set of H. A G …