On the Computational Complexity of Local and Global Covering Numbers

Miriam Goetze, Lucas Schwebler

The global and local $\mathcal{G}$-covering number $c_{\mathrm{g}}^{\mathcal{G}}(H)$ and $c_{\mathrm{l}}^{\mathcal{G}}(H)$ encode how well the edges of a graph $H$ can be covered w…