Cliques are complete subgraphs of a graph. This note shows 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.
