1 problem

Let $\mathcal{H}$ be a minor-closed graph class. For a graph $G$, let $\mathsf{id}_{\mathcal{H}}(G)$ denote the minimum number of edge identifications needed to transform $G$ into…