1 problem

Let $G$ be a $P_4$-free graph, also called a cograph. The edge clique cover number $\theta_\mathrm{e}(G)$ is the minimum cardinality of a family of cliques such that every edge of…