Covering line graphs with equivalence relations

An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph GG is the minimum number of equivalence subgraphs needed to cover the edges of GG. We consider the equivalence number of a line graph, giving improved upper and lower bounds: 13log2log2χ(G)