# zbMATH — the first resource for mathematics

$$p$$-edge clique coverings of graphs. (English) Zbl 0862.05088
The purpose of this note is to point out that the $$p$$-intersection graph versions of characterization theorems for various types of intersection graphs are fairly straightforward to establish.

##### MSC:
 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)