Abstract
For a finite collection of graphs ${\cal F}$, the $\mathcal{F}$-M-Deletion problem consists in, given a graph $G$ and an integer $k$, deciding whether there exists $S \subseteq V(G)$ with $|S| \leq...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have