Adding an Edge in a $P_4$-sparse Graph

Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios

The minimum completion (fill-in) problem is defined as follows: Given a graph family $\mathcal{F}$ (more generally, a property $\Pi$) and a graph $G$, the completion problem asks for…