Clique covering and clique partition in generalizations of line graphs

Cliques are complete subgraphs of a graph. In this note we show that minimum sets of maximal cliques covering, respectively partitioning the edge set of a graph can be computed efficiently for certain superclasses of the class of line graphs.